Search Results for ""

The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.

Hansen's problem is a problem in surveying described as follows. From the position of two known but inaccessible points A and B, determine the position of two unknown ...

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

The problem of finding all independent irreducible algebraic relations among any finite set of quantics.

For any algebraic number x of degree n>2, a rational approximation p/q to x must satisfy |x-p/q|>1/(q^n) for sufficiently large q. Writing r=n leads to the definition of the ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

A problem in the calculus of variations. Let a vessel traveling at constant speed c navigate on a body of water having surface velocity u = u(x,y) (1) v = v(x,y). (2) The ...

The approximation problem is a well known problem of functional analysis (Grothendieck 1955). It asks to determine whether every compact operator T from a Banach space X to a ...