Search Results for ""

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

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

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 Euler-Gergonne-Soddy circle, a term coined here for the first time, is the circumcircle of the Euler-Gergonne-Soddy triangle. Since the Euler-Gergonne-Soddy triangle is a ...

A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...

The system of partial differential equations describing fluid flow in the absence of viscosity, given by (partialu)/(partialt)+u·del u=-(del P)/rho, where u is the fluid ...

An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...