Search Results for ""

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

The number of degrees of freedom in a problem, distribution, etc., is the number of parameters which may be independently varied.

(1) or (2) The solutions are Jacobi polynomials P_n^((alpha,beta))(x) or, in terms of hypergeometric functions, as y(x)=C_1_2F_1(-n,n+1+alpha+beta,1+alpha,1/2(x-1)) ...

Gardner showed how to dissect a square into eight and nine acute scalene triangles. W. Gosper discovered a dissection of a unit square into 10 acute isosceles triangles, ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The ...

A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...

A congruence of the form f(x)=0 (mod n) where f(x) is an integer polynomial (Nagell 1951, p. 73).

Arnauld's paradox states that if negative numbers exist, then (-1)/1 must equal 1/(-1), which asserts that the ratio of a smaller to a larger quantity equals the ratio of the ...