Search Results for ""

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...

An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...

Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...

The covariant derivative of the Riemann tensor is given by (1) Permuting nu, kappa, and eta (Weinberg 1972, pp. 146-147) gives the Bianchi identities ...

A two-sided (doubly infinite) Z-Transform, Z^((2))[{a_n}_(n=-infty)^infty](z)=sum_(n=-infty)^infty(a_n)/(z^n) (Zwillinger 1996; Krantz 1999, p. 214). The bilateral transform ...

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...