Search Results for ""

There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...

Several different types of checkerboards are used in different variants of the game of checkers. The usual checkerboard is the one used in so-called "pool checkers," also ...

Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.

A way to display n variables on a two-dimensional surface. For instance, let x be eyebrow slant, y be eye size, z be nose length, etc. The above figures show faces produced ...

Each Cartan matrix determines a unique semisimple complex Lie algebra via the Chevalley-Serre, sometimes called simply the "Serre relations." That is, if (A_(ij)) is a k×k ...

The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...

Let the probabilities of various classes in a distribution be p_1, p_2, ..., p_k, with observed frequencies m_1, m_2, ..., m_k. The quantity ...

The chi distribution with n degrees of freedom is the distribution followed by the square root of a chi-squared random variable. For n=1, the chi distribution is a ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

Let r and s be positive integers which are relatively prime and let a and b be any two integers. Then there is an integer N such that N=a (mod r) (1) and N=b (mod s). (2) ...