Search Results for ""

The geometric distribution is a discrete distribution for n=0, 1, 2, ... having probability density function P(n) = p(1-p)^n (1) = pq^n, (2) where 0<p<1, q=1-p, and ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...

A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...

If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...

A number which is simultaneously octagonal and hexagonal. Let O_n denote the nth octagonal number and H_m the mth hexagonal number, then a number which is both octagonal and ...

A hyper-Kähler manifold can be defined as a Riemannian manifold of dimension 4n with three covariantly constant orthogonal automorphisms I, J, K of the tangent bundle which ...

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...