Search Results for ""

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...

Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...

A Gaussian sum is a sum of the form S(p,q)=sum_(r=0)^(q-1)e^(-piir^2p/q), (1) where p and q are relatively prime integers. The symbol phi is sometimes used instead of S. ...

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.

An element of an extension field of a field F which is not algebraic over F. A transcendental number is a complex number which is transcendental over the field Q of rational ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...