Search Results for ""

A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...

N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

By analogy with the divisor function sigma_1(n), let pi(n)=product_(d|n)d (1) denote the product of the divisors d of n (including n itself). For n=1, 2, ..., the first few ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

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

An analytic function f(z) satisfying the irreducible algebraic equation A_0(z)f^k+A_1(z)f^(k-1)+...+A_k(z)=0 with single-valued meromorphic functions A_j(z) in a complex ...

A statistic defined to improve the Kolmogorov-Smirnov test in the tail of a distribution.

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).