Search Results for ""

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

The Monty Hall problem is named for its similarity to the Let's Make a Deal television game show hosted by Monty Hall. The problem is stated as follows. Assume that a room is ...

A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...

Find a square number x^2 such that, when a given integer h is added or subtracted, new square numbers are obtained so that x^2+h=a^2 (1) and x^2-h=b^2. (2) This problem was ...

In a boarding school there are fifteen schoolgirls who always take their daily walks in rows of threes. How can it be arranged so that each schoolgirl walks in the same row ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...

The shortest path problem seeks to find the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u,v) of a directed or undirected graph. The length of the ...

A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...