Search Results for ""

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 problem of determining (or counting) the set of all solutions to a given problem.

Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...

A mathematical problem, usually not requiring advanced mathematics, to which a solution is desired. Puzzles frequently require the rearrangement of existing pieces (e.g., 15 ...

Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...

A problem is an exercise whose solution is desired. Mathematical "problems" may therefore range from simple puzzles to examination and contest problems to propositions whose ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

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