Search Results for ""

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

The problem in calculus of variations to find the minimal surface of a boundary with specified constraints (usually having no singularities on the surface). In general, there ...

What is the probability that a chord drawn at random on a circle of radius r (i.e., circle line picking) has length >=r (or sometimes greater than or equal to the side length ...

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...