Search Results for ""

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).

The identity F_n^4-F_(n-2)F_(n-1)F_(n+1)F_(n+2)=1, where F_n is a Fibonacci number.

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.

F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.

A number which does not divide another exactly. For instance, 4 and 5 are aliquant divisors of 6. A number which is not an aliquant divisor (i.e., one that does divide ...

A quantity which does not equal zero is said to be nonzero. A real nonzero number must be either positive or negative, and a complex nonzero number can have either real or ...

An object is unique if there is no other object satisfying its defining properties. An object is said to be essentially unique if uniqueness is only referred to the ...

In general, a frieze consists of repeated copies of a single motif. b ; a d; c Conway and Guy (1996) define a frieze pattern as an arrangement of numbers at the intersection ...