Search Results for ""

The Rogers mod 14 identities are a set of three Rogers-Ramanujan-like identities given by A(q) = sum_(n=0)^(infty)(q^(n^2))/((q;q)_n(q;q^2)_n) (1) = ...

Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...

A generalization of the binomial coefficient whose notation was suggested by Knuth, |_n; k]=(|_n]!)/(|_k]!|_n-k]!), (1) where |_n] is a Roman factorial. The above expression ...

|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...

A powerful numerical integration technique which uses k refinements of the extended trapezoidal rule to remove error terms less than order O(N^(-2k)). The routine advocated ...

The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...

A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...

For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...

Let sum_(k=1)^(infty)u_k be a series with positive terms, and let rho=lim_(k->infty)u_k^(1/k). 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series ...

A special graph vertex that is designated to turn a tree into a rooted tree or a graph into a rooted graph. The root is sometimes also called "eve," or an "endpoint" (Saaty ...