Search Results for ""
1111 - 1120 of 4217 for Strong Lawof Small NumbersSearch Results

The product of any number of perspectivities.
Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...
A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...
The term "natural number" refers either to a member of the set of positive integers 1, 2, 3, ... (OEIS A000027) or to the set of nonnegative integers 0, 1, 2, 3, ... (OEIS ...
A number of the form aba..., abab..., etc. The first few nontrivial undulants (with the stipulation that a!=b) are 101, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, ... ...
A Woodall prime is a Woodall number W_n=2^nn-1 that is prime. The first few Woodall primes are 7, 23, 383, 32212254719, 2833419889721787128217599, ... (OEIS A050918), ...
A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...
A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...
A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...
In a 1631 edition of Academiae Algebrae, J. Faulhaber published the general formula for the power sum of the first n positive integers, sum_(k=1)^(n)k^p = H_(n,-p) (1) = ...

...