Search Results for ""

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.

Conditions at an initial time t=t_0 from which a given set of mathematical equations or physical system evolves. A system with initial conditions specified is known as an ...

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

An Abelian variety which is canonically attached to an algebraic variety which is the solution to a certain universal problem. The Albanese variety is dual to the Picard ...

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

The problem of forecasting future values X_(t+tau) (tau>0) of a weakly stationary process {X_t} from the known values X_s (s<=t).

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

If at least one solution can be determined for a given problem, a solution to that problem is said to exist. Frequently, mathematicians seek to prove the existence of ...

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...