Search Results for ""

Serre's problem, also called Serre's conjecture, asserts that the implication "free module ==> projective module" can be reversed for every module over the polynomial ring ...

Honaker's problem asks for all consecutive prime number triples (p,q,r) with p<q<r such that p|(qr+1). Caldwell and Cheng (2005) showed that the only Honaker triplets for ...

Find the figure bounded by a line which has the maximum area for a given perimeter. The solution is a semicircle. The problem is based on a passage from Virgil's Aeneid: "The ...

In a given circle, find an isosceles triangle whose legs pass through two given points inside the circle. This can be restated as: from two points in the plane of a circle, ...

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

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 ...

In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...

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 ...