Search Results for ""

For n players, n-1 games are needed to fairly determine first place, and n-1+lg(n-1) are needed to fairly determine first and second place.

If (1+xsin^2alpha)sinbeta=(1+x)sinalpha, then (1+x)int_0^alpha(dphi)/(sqrt(1-x^2sin^2phi))=int_0^beta(dphi)/(sqrt(1-(4x)/((1+x)^2)sin^2phi)).

An algorithm for computing an Egyptian fraction.

A spherical image of a curve. The most common indicatrix is Dupin's indicatrix.

A polynomial in which the sum of subscripts is the same in each term.

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...

A fractal process for which H>1/2, so r>0.

A distribution with kurtosis excess gamma_2<0, and therefore having a flattened shape.

The Betti numbers of a compact orientable n-manifold satisfy the relation b_i=b_(n-i).