Search Results for ""

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

A tensor t is said to satisfy the double contraction relation when t_(ij)^m^_t_(ij)^n=delta_(mn). (1) This equation is satisfied by t^^^0 = (2z^^z^^-x^^x^^-y^^y^^)/(sqrt(6)) ...

G = int_0^infty(e^(-u))/(1+u)du (1) = -eEi(-1) (2) = 0.596347362... (3) (OEIS A073003), where Ei(x) is the exponential integral. Stieltjes showed it has the continued ...

The symmetry operation corresponding to a rotation followed by an inversion operation, also called a rotoinversion. This operation is denoted n^_ for an improper rotation by ...

One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...

The general sextic equation x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 can be solved in terms of Kampé de Fériet functions, and a restricted class of sextics can be solved in ...

The maximal number of regions into which space can be divided by n planes is f(n)=1/6(n^3+5n+6) (Yaglom and Yaglom 1987, pp. 102-106). For n=1, 2, ..., these give the values ...

The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...