Search Results for ""

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...

Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...

Find consecutive powers, i.e., solutions to x^p-y^q=+/-1, excluding 0 and 1. Catalan's conjecture states that the only solution is 3^2-2^3=1, so 8 and 9 (2^3 and 3^2) are the ...

Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...

Let H be a Hilbert space and (e_i)_(i in I) is an orthonormal basis for H. The set S(H) of all operators T for which sum_(i in I)||Te_i||^2<infty is a self-adjoint ideal of ...

If the section function of a centered convex body in n-dimensional Euclidean space (n>=3) is smaller than that of another such body, is its volume also smaller? The solution ...

Given five equal disks placed symmetrically about a given center, what is the smallest radius r for which the radius of the circular area covered by the five disks is 1? The ...

The probability of getting at least one "6" in four rolls of a single 6-sided die is 1-(5/6)^4 approx 0.5177, (1) which is slightly higher than the probability of at least ...