Search Results for ""

A generalization of Turán's theorem to non-complete graphs.

A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...

Erdős offered a $3000 prize for a proof of the proposition that "If the sum of reciprocals of a set of integers diverges, then that set contains arbitrarily long arithmetic ...

The Erdős number is the number of "hops" needed to connect the author of a paper with the prolific late mathematician Paul Erdős. An author's Erdős number is 1 if he has ...

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...

Given a Poisson distribution with a rate of change lambda, the distribution function D(x) giving the waiting times until the hth Poisson event is D(x) = ...

Given a formula y=f(x) with an absolute error in x of dx, the absolute error is dy. The relative error is dy/y. If x=f(u,v,...), then ...

An object is unique if there is no other object satisfying its defining properties. An object is said to be essentially unique if uniqueness is only referred to the ...

An estimate is an educated guess for an unknown quantity or outcome based on known information. The making of estimates is an important part of statistics, since care is ...

The sequence of numbers obtained by letting a_1=2, and defining a_n=lpf(1+product_(k=1)^(n-1)a_k) where lpf(n) is the least prime factor. The first few terms are 2, 3, 7, 43, ...