| • Science | • People | • Locations | • Timeline |
is prime for all non-negative integers less than 40. The primes for n = 0, 1, 2, 3... are 41, 43, 47, 53, 61, 71... The differences between the terms are 2, 4, 6, 8, 10... For n = 40, it produces a square number, 1681, which is equal to 41×41, the smallest composite number for this formula. In fact if 41 divides n it divides P(n) too. The phenomenon is related to the Ulam spiral, which is also implicitly quadratic, and the class number.
A set of diophantine equations in 26 variables can be used to obtain primes: A given number k + 2 is prime iff the following system of diophantine equations has a solution in the natural numbers (Riesel, 1994):
The following function yields all the primes, and only primes, for non-negative integers n:
This formula is based on Wilson's theoremModular arithmetic Theorems In mathematics, Wilson's Theorem states that a natural number n > 1 is prime if and only if: : (see factorial and modular arithmetic for the notation). History The theorem was first discovered by John Wilson, a student of the E; the number two is generated many times and all other primes are generated exactly once by this function. (In fact a prime p is generated for n = (p − 1) and 2 otherwise (ie. when n + 1 is composite))
Using the floor functionIn mathematics, the floor function is the function defined as follows: for a real number x floor x is the largest integer less than or equal to x''. For example, floor(2. 9) 2, floor(-2) -2 and floor(-2. The floor function is also denoted by x or. A more (defined to be the largest integer less than or equal to the real numberIn mathematics, the real numbers are intuitively defined as numbers that are in one-to-one correspondence with the points on an infinite line—the number line. The term "real number" is a retronym coined in response to " imaginary number". Real numbers may x), one can construct several formulas for the n-th prime. These formulas are also based on Wilson's theorem and have little practical value: the methods mentioned above under "Finding prime numbers" are much more efficient.
Define
or, alternatively,
These definitions are equivalent; π(m) is the number of primes less than or equal to m. The n-th prime number pn can then be written as
Another approach does not use factorials and Wilson's theorem, but also heavily employs the floor function (S. M. Ruiz 2000): first define
and then