Search Results for ""

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.

The number of digits used to perform a given computation. The concepts of accuracy and precision are both closely related and often confused. While the accuracy of a number x ...

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

Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...

The ratio of two numbers r and s is written r/s, where r is the numerator and s is the denominator. The ratio of r to s is equivalent to the quotient r/s. Betting odds ...

The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...

z^p-y^p=(z-y)(z-zetay)...(z-zeta^(p-1)y), where zeta=e^(2pii/p) (a de Moivre number) and p is a prime.

alpha is called a predecessor if there is no ordinal number beta such that beta+1=alpha.