Prime number

"Prime" redirects here. For other uses, see Prime (disambiguation).

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example 5 is prime, as only 1 and 5 divide it, whereas 6 is composite, since it has the divisors 2 and 3 in addition to 1 and 6. The fundamental theorem of arithmetic establishes the central role of primes in number theory: any integer greater than 1 can be expressed as a product of primes that is unique up to ordering. This theorem requires excluding 1 as a prime.

The property of being prime is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and √n. Algorithms that are much more efficient than trial division have been devised to test the primality of large numbers. Particularly fast methods are available for primes of special forms, such as Mersenne primes. As of 2011^[update], the largest known prime number has nearly 13 million decimal digits.

There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known useful formula that yields all of the prime numbers and no composites. However, the distribution of primes, that is to say, the statistical behaviour of primes in the large, can be modeled. The first result in that direction is the prime number theorem, proven at the end of the 19th century, which says that the probability that a given, randomly chosen number n is prime is inversely proportional to its number of digits, or the logarithm of n.

Many questions around prime numbers remain open, such as Goldbach's conjecture, which asserts that every even integer greater than 2 can be expressed as the sum of two primes, and the twin prime conjecture, which says that there are infinitely many pairs of primes whose difference is 2. Such questions spurred the development of various branches of number theory, focusing on analytic or algebraic aspects of numbers. Primes are used in several routines in information technology, such as public-key cryptography, which makes use of properties such as the difficulty of factoring large numbers into their prime factors. Prime numbers give rise to various generalizations in other mathematical domains, mainly algebra, such as prime elements and prime ideals.

Definition and examples

A natural number

1, 2, 3, 4, 5, 6, ...

is called a prime or a prime number if it is greater than 1 and has exactly two divisors, 1 and the number itself.^[1] Natural numbers greater than 1 that are not prime are called composite.

The number 12 is not a prime, as 12 items can be placed into 3 equal sized columns of 4 each (amongst other ways). 11 items cannot be all placed into several equal sized columns of more than 1 item each, there will always be some extra items left (a remainder). Therefore the number 11 is a prime.

Among the numbers 1 to 6, the numbers 2, 3, and 5 are the prime numbers, while 1, 4, and 6 are not prime. 1 is excluded as a prime number, for reasons explained below. 2 is a prime number, since the only natural numbers dividing it are 1 and 2. Next, 3 is prime, too: 1 and 3 do divide 3 without remainder, but 3 divided by 2 gives remainder 1. Thus, 3 is prime. However, 4 is composite, since 2 is another number (in addition to 1 and 4) dividing 4 without remainder:

4 = 2 · 2.

5 is again prime: none of the numbers 2, 3, or 4 divide 5. Next, 6 is divisible by 2 or 3, since

6 = 2 · 3.

Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. More generally, no even number greater than 2 is prime: any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime number greater than 2. In a similar vein, all prime numbers bigger than 5, written in the usual decimal system, end in 1, 3, 7 or 9, since even numbers are multiples of 2 and numbers ending in 0 or 5 are multiples of 5.

If n is a natural number, then 1 and n divide n without remainder. Therefore, the condition of being a prime can also be restated as: a number is prime if it is greater than one and if none of

2, 3, ..., n − 1

divides n (without remainder). Yet another way to say the same is: a number n > 1 is prime if it cannot be written as a product of two integers a and b, both of which are larger than 1:

n = a · b.

In other words, n is prime if n items can not be divided up into smaller equal-sized groups of more than one item.

The smallest 168 prime numbers (all the prime numbers under 1000) are:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997 (sequence A000040 in OEIS).

The set of all primes is often denoted P.

The fundamental theorem of arithmetic

Main article: Fundamental theorem of arithmetic

The crucial importance of prime numbers to number theory and mathematics in general stems from the fundamental theorem of arithmetic, which states that every positive integer larger than 1 can be written as a product of one or more primes in a way which is unique except possibly for the order of the prime factors.^[2] Primes can thus be considered the “basic building blocks” of the natural numbers. For example:

23244	= 2 · 2 · 3 · 13 · 149
	= 22 · 3 · 13 · 149. (22 denotes the square or second power of 2.)

As in this example, the same prime factor may occur multiple times. A decomposition:

n = p₁ · p₂ · ... · p_t

of a number n into (finitely many) prime factors p₁, p₂, ... to p_t is called prime factorization of n. The fundamental theorem of arithmetic can be rephrased so as to say that any factorization into primes will be identical except for the order of the factors. So, albeit there are many prime factorization algorithms to do this in practice for larger numbers, they all have to yield the same result.

If p is a prime number and p divides a product ab of integers, then p divides a or p divides b. This proposition is known as Euclid's lemma.^[3] It is used in some proofs of the uniqueness of prime factorizations.

Primality of one

Most early Greeks did not even consider 1 to be a number^[4], so clearly did not consider it a prime. In the 19th century however, many mathematicians did consider the number 1 a prime. For example, Derrick Norman Lehmer's list of primes up to 10,006,721, reprinted as late as 1956,^[5] started with 1 as its first prime.^[6] Henri Lebesgue is said to be the last professional mathematician to call 1 prime.^[7] Although a large body of mathematical work is also valid when calling 1 a prime, the above fundamental theorem of arithmetic does not hold as stated. For example, the number 15 can be factored as 3 · 5 or 1 · 3 · 5. If 1 were admitted as a prime, these two presentations would be considered different factorizations of 15 into prime numbers, so the statement of that theorem would have to be modified. Furthermore, the prime numbers have several properties that the number 1 lacks, such as the relationship of the number to its corresponding value of Euler's totient function or the sum of divisors function.^[8][9]

History

The Sieve of Eratosthenes is a simple algorithm for finding all prime numbers up to a specified integer. It was created in the 3rd century BC by Eratosthenes, an ancient Greek mathematician. (Click to see animation.)

There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers come from the Ancient Greeks. Euclid's Elements (circa 300 BC) contain important theorems about primes, including the infinitude of primes and the fundamental theorem of arithmetic. Euclid also showed how to construct a perfect number from a Mersenne prime. The Sieve of Eratosthenes, attributed to Eratosthenes, is a simple method to compute primes, although the large primes found today with computers are not generated this way.

After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). A special case of Fermat's theorem may have been known much earlier by the Chinese. Fermat conjectured that all numbers of the form 2²ⁿ + 1 are prime (they are called Fermat numbers) and he verified this up to n = 4 (or 2¹⁶ + 1). However, the very next Fermat number 2³² + 1 is composite (one of its prime factors is 641), as Euler discovered later, and in fact no further Fermat numbers are known to be prime. The French monk Marin Mersenne looked at primes of the form 2^p − 1, with p a prime. They are called Mersenne primes in his honor.

Euler's work in number theory included many results about primes. He showed the infinite series 1/2 + 1/3 + 1/5 + 1/7 + 1/11 + … is divergent. In 1747 he showed that the even perfect numbers are precisely the integers of the form 2^p−1(2^p − 1), where the second factor is a Mersenne prime.

At the start of the 19th century, Legendre and Gauss independently conjectured that as x tends to infinity, the number of primes up to x is asymptotic to x/ln(x), where ln(x) is the natural logarithm of x. Ideas of Riemann in his 1859 paper on the zeta-function sketched a program which would lead to a proof of the prime number theorem. This outline was completed by Hadamard and de la Vallée Poussin, who independently proved the prime number theorem in 1896.

Proving a number is prime is not done (for large numbers) by trial division. Many mathematicians have worked on primality tests for large numbers, often restricted to specific number forms. This includes Pépin's test for Fermat numbers (1877), Proth's theorem (around 1878), the Lucas–Lehmer primality test (originated 1856),^[10] and the generalized Lucas primality test. More recent algorithms like APRT-CL, ECPP, and AKS work on arbitrary numbers but remain much slower.

For a long time, prime numbers were thought to have extremely limited application outside of pure mathematics;^{[citation needed]} this changed in the 1970s when the concepts of public-key cryptography were invented, in which prime numbers formed the basis of the first algorithms such as the RSA cryptosystem algorithm.

Since 1951 all the largest known primes have been found by computers. The search for ever larger primes has generated interest outside mathematical circles. The Great Internet Mersenne Prime Search and other distributed computing projects to find large primes have become popular in the last ten to fifteen years, while mathematicians continue to struggle with the theory of primes.

The number of prime numbers

Main article: Euclid's theorem

There are infinitely many prime numbers. Another way of saying this is that the sequence

2, 3, 5, 7, 11, 13, ...

of prime numbers never ends. This statement is referred to as Euclid's theorem in honor of the ancient Greek mathematician Euclid, since the first known proof for this statement is attributed to him. Many more proofs of the infinitude of primes are known, including an analytical proof by Euler, Goldbach's proof based on Fermat numbers,^[11] Fürstenberg's proof using general topology,^[12] and Kummer's elegant proof.^[13]

Euclid's proof

Euclid's proof (Book IX, Proposition 20^[14]) begins with the definition of prime and then considers any finite set of primes, which we denote p₁, p₂, up to p_n. The key idea is to consider the product of all these numbers plus one (this number is called a Euclid number):

P = p₁ · p₂ · ... · p_n + 1.

Like any natural number, P can be written as a product of prime numbers; this is assured by the fundamental theorem of arithmetic:

P = q₁ · q₂ · ... · q_m

(it is possible that P itself is prime, in which case m = 1).

None of the primes p₁, p₂, etc., to p_n can divide P, because dividing P by any of these leaves a remainder of 1. Therefore the primes q₁, q₂, ..., q_m are additional primes beyond the ones we started with. Thus any finite set of primes can be extended to a larger finite set of primes.

The Euclid number P need not be prime, for example

2 · 3 · 5 · 7 · 11 · 13 + 1 = 30,031 = 59 · 509 (both primes).

It is often erroneously reported that Euclid proved the infinitude of primes by contradiction, beginning with the assumption that the set initially considered contains all prime numbers, or that it contains precisely the n smallest primes, rather than any arbitrary finite set of primes.^[15]

Euler's analytical proof

Euler's proof uses the sum of the reciprocals of primes,

$S(p) = \frac 1 2 + \frac 1 3 + \frac 1 5 + \frac 1 7 + \cdots + \frac 1 p.$

This sum becomes bigger than any arbitrary real number provided that p is big enough.^[16] This shows that there are infinitely many primes, since otherwise this sum would grow only until the biggest prime p is reached. The growth of S(p) is quantified by Mertens' second theorem.^[17] For comparison, the sums

$\frac 1 {1^2} + \frac 1 {2^2} + \frac 1 {3^2} + \cdots + \frac 1 {n^2} = \sum_{i=1}^n \frac 1 {i^2}$

do not grow to infinity, when n grows. In this sense, prime numbers occur more often than squares of natural numbers. Brun's theorem states that the sum of the reciprocals of twin primes,

$\left( {\frac{1}{3} + \frac{1}{5}} \right) + \left( {\frac{1}{5} + \frac{1}{7}} \right) + \left( {\frac{1}{{11}} + \frac{1}{{13}}} \right) + \cdots = \sum\limits_{ \begin{smallmatrix} p \text{ prime, } \\ p + 2 \text { prime} \end{smallmatrix}} {\left( {\frac{1}{p} + \frac{1}{{p + 2}}} \right)},$

is finite.

Testing primality and integer factorization

There are various methods to determine whether a given number n is prime. The most basic routine, trial division is of little practical use because of its slowness. One group of modern primality tests is applicable to arbitrary numbers, while more efficient tests are available for particular numbers. Most such methods only tell whether n is prime or not. Routines also yielding one (or all) prime factors of n are called factorization algorithms.

Trial division

The most basic method of checking the primality of a given integer n is called trial division. This routine consists in dividing n by each integer m which is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise, it is a prime. Indeed, if n = ab is composite (with a and b ≠ 1) then one of the factors a or b is necessarily at most √n. For example, for n = 37, the trial divisions are by m = 2, 3, 4, 5, and 6. None of these numbers divides 37, so 37 is prime. This routine can be implemented more efficiently if a complete list of primes up to √n is known—then trial divisions only need to be checked for those m that are prime. For example, to check the primality of 37, only three divisions are necessary (m = 2, 3, and 5), given that 4 and 6 are composite.

While a simple method, trial division quickly becomes impractical for testing large integers because the number of possible factors grows too rapidly as n increases. According to the prime number theorem explained below, the number of prime numbers less than √n is approximately given by √n / ln(√n), so the algorithm may need up to this number of trial divisions to check the primality of n. For n = 10²⁰, this number is 450 million—too large for many practical applications.

Sieves

An algorithm yielding all primes up to a given limit, such as required in the trial division method, is called a sieve. The oldest example, the sieve of Eratosthenes (see above) is useful for relatively small primes. The modern sieve of Atkin is more complicated, but faster when properly optimized. Before the advent of computers, lists of primes up to bounds like 10⁷ were also used.^[18]

Primality testing vs. primality proving

Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. The former merely "test" whether n is prime in the sense that they declare n to be (definitely) composite or "probably prime", which latter means that n may or may not be a prime number. Composite numbers which do pass a given primality test are referred to as pseudoprimes. For example, Fermat's primality test relies on Fermat's little theorem. This theorem says for any prime number p, and any integer a not divisible by p, a^{p − 1} − 1 is divisible by p. Thus, if a^{n − 1} − 1 is not divisible by n, n cannot be prime. However, conversely, n may be composite even if this divisibility holds. In fact, there are infinitely many composite numbers n which pass the Fermat primality test for every choice of a that is coprime with n (Carmichael numbers), for example n = 561.

Deterministic algorithms do not erroneously report composite numbers as prime. In practice, the fastest such method is known as elliptic curve primality proving. Analyzing its run time is based on heuristic arguments, as opposed to the rigorously proven complexity of the more recent AKS primality test. Deterministic methods are typically slower than probabilistic ones, so the latter ones are typically applied first before a more time-consuming deterministic routine is employed.

The following table lists a number of prime tests. The running time is given in terms of n, the number to be tested and, for probabilistic algorithms, the number k of tests performed. Moreover, ε is an arbitrarily small positive number, and log is the logarithm to an unspecified base. The big O notation means that, for example, elliptic curve primality proving requires a time that is bounded by a factor (not depending on n, but on ε) times log^5+ε(n).

Test	Developed in	Type	Running time	Notes
AKS primality test	2002	deterministic	O(log6+ε(n))
Elliptic curve primality proving	1977	deterministic	O(log5+ε(n)) heuristically
Miller–Rabin primality test	1980	probabilistic	O(k · log2+ε (n))	error probability 4−k
Solovay–Strassen primality test	1977	probabilistic	O(k · log3 n)	error probability 2−k
Fermat primality test		probabilistic	O(k · log2+ε (n))	fails for Carmichael numbers

Special-purpose algorithms and the largest known prime

Further information: List of prime numbers

Construction of a regular pentagon. 5 is a Fermat prime.

In addition to the aforementioned tests applying to any natural number n, a number of much more efficient primality tests is available for special numbers. For example, to run Lucas' primality test requires the knowledge of the prime factors of n − 1, while the Lucas–Lehmer primality test needs the prime factors of n + 1 as input. For example, these tests can be applied to check whether

n! ± 1 = 1 · 2 · 3 · ... · n ± 1

are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2^p − 1, where p is an arbitrary prime. The Lucas–Lehmer test is particularly fast for numbers of this form. This is why the largest known prime has almost always been a Mersenne prime since the dawn of electronic computers.

Fermat primes are of the form F_k = 2^2k + 1, with k an arbitrary natural number. They are named after Pierre de Fermat who conjectured that all such numbers F_k are prime. This was based on the evidence of the first five numbers in this series—3, 5, 17, 257, and 65,537—being prime. However, F₆ is composite and so are all other Fermat numbers that have been verified as of 2011. A regular n-gon is constructible using straightedge and compass if and only if

n = 2ⁱ · m

where m is a product of any number of distinct Fermat primes and i is any natural number, including zero.

The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits.^[19] The Electronic Frontier Foundation also offers $150,000 and $250,000 for primes with at least 100 million digits and 1 billion digits, respectively.^[20] Some of the largest primes not known to have any particular form (that is, no simple formula such as that of Mersenne primes) have been found by taking a piece of semi-random binary data, converting it to a number n, multiplying it by 256^k for some positive integer k, and searching for possible primes within the interval [256^kn + 1, 256^k(n + 1) − 1].

Type	Prime	Number of decimal digits	Date	Found by
Mersenne prime	243,112,609 − 1	12,978,189	August 23, 2008	Great Internet Mersenne Prime Search
not a Mersenne prime (Proth number)	19,249 × 213,018,586 + 1	3,918,990	March 26, 2007	Seventeen or Bust
factorial prime	94550! − 1	429,390	October 2010	Domanov, PrimeGrid[21]
primorial prime	843301# - 1	365,851	December 2010	PrimeGrid[22]
twin primes	65516468355 × 2333333 ± 1	100,355	2009	Twin prime search[23]

Integer factorization

Main article: Integer factorization

Given a composite integer n, the task of providing one (or all) prime factors is referred to as factorization of n. Elliptic curve factorization is an algorithm relying on arithmetic on an elliptic curve.

Distribution

In 1975, number theorist Don Zagier commented that primes both^[24]

“

grow like weeds among the natural numbers, seeming to obey no other law than that of chance [but also] exhibit stunning regularity [and] that there are laws governing their behavior, and that they obey these laws with almost military precision.

”

The distribution of primes in the large, such as the question how many primes are smaller than a given, large threshold, is described by the prime number theorem, but no efficient formula for the n-th prime is known. Dirichlet's theorem on arithmetic progressions quantifies how often linear polynomials

$p(n) = a + bn,\,$

(with integers a and b) take prime values. The corresponding question for quadratic polynomials is less well-understood.

Formulas for primes

Main article: formulas for primes

There is no known efficient formula for primes. For example, Mills' theorem and a theorem of Wright assert that there are real constants A and μ such that

$\left \lfloor A^{3^{n}}\right \rfloor \text{ and } \left \lfloor 2^{\dots^{2^{2^\mu}}} \right \rfloor$

are prime for any natural number n. Here $\lfloor - \rfloor$ represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev) which states that there always exists at least one prime number p with n < p < 2n − 2, for any natural number n > 3. However, computing A or μ requires the knowledge of infintely many primes to begin with.^[25] Another formula is based on Wilson's theorem and generates the number 2 many times and all other primes exactly once.

There is no non-constant polynomial, even in several variables, that takes only prime values. However, there is a set of Diophantine equations in 9 variables and one parameter with the following property: the parameter is prime if and only if the resulting system of equations has a solution over the natural numbers. This can be used to obtain a single formula with the property that all its positive values are prime.

Number of prime numbers below a given number

Main article: Prime number theorem

A chart depicting π(n) (blue), n / ln (n) (green) and Li(n) (red)

The prime counting function π(n) is defined as the number of primes up to n. For example π(11) = 5, since there are five primes less than or equal to 11. There are known algorithms to compute exact values of π(n) faster than it would be possible to compute each prime up to n. The prime number theorem states that π(n) is approximately given by

$\pi(n) \approx \frac n {\ln(n)},$

in the sense that the ratio of π(n) and the right hand fraction approaches 1 when n grows to infinity. This implies that the likelihood that a number less than n is prime is (approximately) inversely proportional to the number of digits in n. A more accurate estimate for π(n) is given by the offset logarithmic integral

$\operatorname{Li}(n) = \int_2^n \frac{dt}{\ln(t)}.$

The prime number theorem also implies estimates for the size of the n-th prime number p_n (i.e., p₁ = 2, p₂ = 3, etc.): up to a bounded factor, p_n grows like n log(n).^[26] In particular, the prime gaps, i.e. the differences p_n − p_n−1 of two consecutive primes, become arbitrarily large. This latter statement can also be seen in a more elementary way by noting that the sequence n! + 2, n! + 3, …, n! + n (for the notation n! read factorial) consists of n − 1 composite numbers, for any natural number n.

Arithmetic progressions

An arithmetic progression is the set of natural numbers that give the same remainder when divided by some fixed number q called modulus. For example,

3, 12, 21, 30, 39, ...,

is an arithmetic progression modulo q = 9. Except for 3, none of these numbers is prime, since 3 + 9n = 3(1 + 3n) so that the remaining numbers in this progression are all composite. (More generally, all prime numbers above q are of form q#·n + m, where 0 < m < q#, and m has no prime factor ≤ q.) Thus, the progression

a, a + q, a + 2q, a + 3q, …

can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are "wrapped around" as soon as a multiple of 9 is passed. Primes are highlighted in red. The rows (=progressions) starting with a = 3, 6, or 9 contain at most one prime number. In all other rows (a = 1, 2, 4, 5, 7, and 8) there are infinitely many prime numbers. What is more, the primes are distributed equally among those rows in the long run—the density of all primes congruent a modulo 9 is 1/6.

The Green–Tao theorem shows that there are arbitrarily long arithmetic progressions consisting of primes.^[27] An odd prime p is expressible as the sum of two squares, p = x² + y², exactly if p is congruent 1 modulo 4 (Fermat's theorem on sums of two squares).

Prime values of quadratic polynomials

The Ulam spiral. Red pixels show prime numbers. Primes of the form 4n²-2n+41 are highlighted in blue.

Euler noted that the function

$n^2 + n + 41\,$

gives prime numbers for 0 ≤ n < 40,^[28][29] a fact leading into deep algebraic number theory, more specifically Heegner numbers. For bigger n, it does take composite values. The Hardy-Littlewood conjecture F makes an asymptotic prediction about the density of primes among the values of quadratic polynomials (with integer coefficients a, b, and c)

$f(n) = a x^2 + bx + c\,$

in terms of Li(n) and the coefficients a, b, and c. However, progress has proved hard to come by: no quadratic polynomial (with a ≠ 0) is known to take infinitely many prime values. The Ulam spiral depicts all natural numbers in a spiral-like way. Surprisingly, prime numbers cluster on certain diagonals and not others, suggesting that some quadratic polynomials take prime values more often than other ones.

Open questions

The zeta function and the Riemann hypothesis

Main article: Riemann hypothesis

Plot of the zeta function ζ(s). At s=1, the function has a pole, i.e. tends to infinity.

The Riemann zeta function ζ(s) is defined as an infinite sum

$\zeta(s)=\sum_{n=1}^\infin \frac{1}{n^s},$

where s is a complex number with real part bigger than 1. It is a consequence of the fundamental theorem of arithmetic that this sum agrees with the infinite product

$\prod_{p \text{ prime}} \frac{1}{1-p^{-s}}.$

The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., exceeds any given number), so there must be infinitely many primes. Another example of the richness of the zeta function and a glimpse of modern algebraic number theory is the following identity (Basel problem), due to Euler,

$\zeta(2) = \prod_{p} \frac{1}{1-p^{-2}}= \frac{\pi^2}{6}.$

The reciprocal of ζ(2), 6/π², is the probability that two numbers selected at random are relatively prime.^[30]

The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.^{[clarification needed]} From a physical viewpoint, it roughly states that the irregularity in the distribution of primes only comes from random noise. From a mathematical viewpoint, it roughly states that the asymptotic distribution of primes (about 1/ log x of numbers less than x are primes, the prime number theorem) also holds for much shorter intervals of length about the square root of x (for intervals near x). This hypothesis is generally believed to be correct. In particular, the simplest assumption is that primes should have no significant irregularities without good reason.

Other conjectures

Further information: Category:Conjectures about prime numbers

In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture which asserts that every even integer n greater than 2 can be written as a sum of two primes. As of February 2011^[update], this conjecture has been verified for all numbers up to n = 2 · 10¹⁷.^[31] Weaker statements than this have been proven, for example Vinogradov's theorem says that every sufficiently large odd integer greater can be written as a sum of three primes. Chen's theorem says that every sufficiently large even number can be expressed as the sum of a prime and a semiprime, the product of two primes. Also, any even integer can be written as the sum of six primes.^[32] The branch of number theory studying such questions is called additive number theory.

Other conjectures deal with the question whether an infinity of prime numbers subject to certain constraints exists. It is conjectured that there are infinitely many Fibonacci primes^[33] and infinitely many Mersenne primes, but not Fermat primes.^[34] It is not known whether or not there are an infinite number of Wieferich primes and of prime Euclid numbers.

A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinitely many pairs of consecutive primes that differ by 2n.^[35] It is conjectured there are infinitely many primes of the form n² + 1.^[36] These conjectures are special cases of the broad Schinzel's hypothesis H. Brocard's conjecture says that there are always at least four primes between the squares of consecutive primes greater than 2. Legendre's conjecture states that there is a prime number between n² and (n + 1)² for every positive integer n. It is implied by the stronger Cramér's conjecture.

Applications

For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic. In particular, number theorists such as British mathematician G. H. Hardy prided themselves on doing work that had absolutely no military significance.^[37] However, this vision was shattered in the 1970s, when it was publicly announced that prime numbers could be used as the basis for the creation of public key cryptography algorithms. Prime numbers are also used for hash tables and pseudorandom number generators.

Some rotor machines were designed with a different number of pins on each rotor, with the number of pins on any one rotor either prime, or coprime to the number of pins on any other rotor. This helped generate the full cycle of possible rotor positions before repeating any position.

The International Standard Book Numbers work with a check digit, which exploits the fact that 11 is a prime.

Arithmetic modulo a prime and finite fields

Main article: Modular arithmetic

Modular arithmetic modifies usual arithmetic by only using the numbers

$\{0, 1, 2, \dots, n-1 \}, \,$

where n is a fixed natural number called modulus. Calculating sums, differences and products is done as usual, but whenever a negative number or a number greater than n−1 occurs, it gets replaced by the remainder after division by n. For instance, for n = 7, the sum 3 + 5 is 1 instead of 8, since 8 divided by 7 has remainder 1. This is referred to by saying "3 + 5 is congruent to 1 modulo 7" and is denoted

$3 + 5 \equiv 1 \ \ (\operatorname{mod}\ 7).$

Similarly, 6 + 1 ≡ 0 (mod 7), 2 − 5 ≡ 4 (mod 7), since −3 + 7 = 4, and 3 · 4 ≡ 5 (mod 7) as 12 has remainder 5. Standard properties of addition and multiplication familiar from the integers remain valid in modular arithmetic. In the parlance of abstract algebra, the above set of integers, which is also denoted Z/nZ, is therefore a commutative ring for any n. Division, however, is not in general possible in this setting. For example, for n = 6, the equation

$3 \cdot x \equiv 2 \ \ (\operatorname{mod}\ 6),$

a solution x of which would be an analogue of 2/3, cannot be solved, as one can see by calculating 3 · 0, ..., 3 · 5 modulo 6. The distinctive feature of prime numbers is the following: division is possible in modular arithmetic if and only if n is a prime. Equivalently, n is prime if and only if all integers m satisfying 2 ≤ m ≤ n − 1 are coprime to n, i.e. their only common divisor is one. Indeed, for n = 7, the equation

$3 \cdot x \equiv 2 \ \ (\operatorname{mod}\ 7),$

has a unique solution, x = 3. Because of this, for any prime p, Z/pZ (also denoted F_p) is called a field or, more specifically, a finite field since it contains finitely many, namely p, elements.

A number of theorems can be derived from inspecting F_p in this abstract way. For example, Fermat's little theorem, stating

$a^{p-1} \equiv 1 (\operatorname{mod}\ p)$

for any integer a not divisble by p, may be proved using these notions. This implies

$\sum_{a=1}^{p-1} a^{p-1} \equiv (p-1) \cdot 1 \equiv -1 \pmod p.$

Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, ¹/_p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction ¹/_p expressed likewise in base q (rather than base 10) has similar effect, provided that p is not a prime factor of q. Wilson's theorem says that an integer p > 1 is prime if and only if the factorial (p − 1)! + 1 is divisible by p. Moreover, an integer n > 4 is composite if and only if (n − 1)! is divisible by n.

Other mathematical occurrences of primes

Many mathematical domains make great use of prime numbers. An example from the theory of finite groups are the Sylow theorems: if G is a finite group and pⁿ is the highest power of the prime p which divides the order of G, then G has a subgroup of order pⁿ. Also, any group of prime order is cyclic (Lagrange's theorem).

Public-key cryptography

Main article: Public key cryptography

Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example 512 bit primes are frequently used for RSA and 1024 bit primes are typical for Diffie–Hellman.). RSA relies on the fact that it is thought to be much easier (i.e., more efficient) to perform the multiplication of two (large) numbers x and y than to calculate x and y (assumed coprime) if only the product xy is known. The Diffie–Hellman key exchange relies on the fact that there are efficient algorithms for modular exponentiation, while the reverse operation the discrete logarithm is thought to be a hard problem.

Prime numbers in nature

Inevitably, some of the numbers that occur in nature are prime. There are, however, relatively few examples of numbers that appear in nature because they are prime.

One example of the use of prime numbers in nature is as an evolutionary strategy used by cicadas of the genus Magicicada.^[38] These insects spend most of their lives as grubs underground. They only pupate and then emerge from their burrows after 13 or 17 years, at which point they fly about, breed, and then die after a few weeks at most. The logic for this is believed to be that the prime number intervals between emergences make it very difficult for predators to evolve that could specialize as predators on Magicicadas.^[39] If Magicicadas appeared at a non-prime number intervals, say every 12 years, then predators appearing every 2, 3, 4, 6, or 12 years would be sure to meet them. Over a 200-year period, average predator populations during hypothetical outbreaks of 14- and 15-year cicadas would be up to 2% higher than during outbreaks of 13- and 17-year cicadas.^[40] Though small, this advantage appears to have been enough to drive natural selection in favour of a prime-numbered life-cycle for these insects.

There is speculation that the zeros of the zeta function are connected to the energy levels of complex quantum systems.^[41]

Generalizations

The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q or the finite field with p elements, whence the name.^[42] Often a second, additional meaning is intended by using the word prime, namely that any object can be, essentially uniquely, decomposed into its prime components. For example, in knot theory, a prime knot is a knot which is indecomposable in the sense that it cannot be written as the knot sum of two nontrivial knots. Any knot can be uniquely expressed as a connected sum of prime knots.^[43] Prime models and prime 3-manifolds are other examples of this type.

Prime elements in rings

Main articles: Prime element and Irreducible element

Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not have a multiplicative inverse) and satisfies the following requirement: given x and y in R such that p divides the product xy, then p divides x or y. An element is irreducible if it cannot be written as a product of two ring elements that are not units. In the ring Z of integers, the set of prime elements equals the set of irreducible elements, which is

$\{ \dots, -11, -7, -5, -3, -2, 2, 3, 5, 7, 11, \dots \}\, .$

In any ring R, any prime element is irreducible. The converse does not hold in general, but does hold for unique factorization domains.

The fundamental theorem of arithmetic continues to hold in unique factorization domains. An example of such a domain is the Gaussian integers Z[i], that is, the set of complex numbers of the form a + bi where i denotes the imaginary unit and a and b are arbitrary integers. Its prime elements are known as Gaussian primes. Not every prime (in Z) is a Gaussian prime: in the bigger ring Z[i], 2 factors into the product of the two Gaussian primes (1 + i) and (1 − i). Rational primes (i.e. prime elements in Z) of the form 4k + 3 are Gaussian primes, whereas rational primes of the form 4k + 1 are not.

Prime ideals

Main article: Prime ideals

In ring theory, the notion of number is generally replaced with that of ideal. Prime ideals, which generalize prime elements in the sense that the principal ideal generated by a prime element is a prime ideal, are an important tool and object of study in commutative algebra, algebraic number theory and algebraic geometry. The prime ideals of the ring of integers are the ideals (0), (2), (3), (5), (7), (11), … The fundamental theorem of arithmetic generalizes to the Lasker–Noether theorem which expresses any ideal in a Noetherian commutative ring as the intersection of primary ideals, which are the appropriate generalizations of prime powers.^[44]

Prime ideals are the points of algebro-geometric objects, via the notion of the spectrum of a ring.^[45] Arithmetic geometry also benefits from this notion, and many concepts exist in both geometry and number theory. For example, factorization or ramification of prime ideals when lifted to an extension field, a basic problem of algebraic number theory, bears some resemblance with ramification in geometry. Such ramification questions occur even in number-theoretic questions solely concerned with integers. For example, prime ideals in the ring of integers of quadratic number fields can be used in proving quadratic reciprocity, a statement which concerns the solvability of quadratic equations

$x^2 \equiv p \ \ (\text{mod } q),\,$

where x is an integer and p and q are (usual) prime numbers.^[46] Early attempts to prove Fermat's Last Theorem climaxed when Kummer introduced regular primes, primes satisfying a certain requirement concerning the failure of unique factorization in the ring consisting of expressions

$a_0 + a_1 \zeta + ... + a_{p-1} \zeta^{p-1}\, ,$

where a₀, ..., a_p−1 are integers and ζ is a complex number such that ζ^p = 1.^[47]

Valuations

Valuation theory studies certain functions from a field K to the real numbers R called valuations.^[48] Every such valuation yields a topology on K, and two valuations are called equivalent if they yield the same topology. A prime of K (sometimes called a place of K) is an equivalence class of valuations. For example, the p-adic valuation of a rational number q is defined to be the integer v_p(q), such that

$q = p^{v_p(q)} \frac {r}{s},$

where both r and s are not divisible by p. For example, v₃(18/7) = 2. The p-adic norm is defined as^{[nb 1]}

$\left| q \right|_p := p^{-v_p(q)}. \,$

In particular, this norm gets smaller when a number is multiplied by p, in sharp contrast to the usual absolute value (also referred to as the infinite prime). While completing Q (roughly, filling the gaps) with respect to the absolute value yields the field of real numbers, completing with respect to the p-adic norm |−|_p yields the field of p-adic numbers.^[49] These are essentially all possible ways to complete Q, by Ostrowski's theorem. Certain arithmetic questions related to Q or more general global fields may be transferred back and forth to the completed (or local) fields. This local-global principle again underlines the importance of primes to number theory.

In the arts and literature

Prime numbers have influenced many artists and writers. The French composer Olivier Messiaen used prime numbers to create ametrical music through "natural phenomena". In works such as La Nativité du Seigneur (1935) and Quatre études de rythme (1949–50), he simultaneously employs motifs with lengths given by different prime numbers to create unpredictable rhythms: the primes 41, 43, 47 and 53 appear in one of the études. According to Messiaen this way of composing was "inspired by the movements of nature, movements of free and unequal durations".^[50]

In his science fiction novel Contact, NASA scientist Carl Sagan suggested that prime numbers could be used as a means of communicating with aliens, an idea that he had first developed informally with American astronomer Frank Drake in 1975.^[51]

Many films, such as Cube, Sneakers, The Mirror Has Two Faces and A Beautiful Mind reflect a popular fascination with the mysteries of prime numbers and cryptography.^[52] Prime numbers are used as a metaphor for loneliness and isolation in the Paolo Giordano novel The Solitude of Prime Numbers, in which they are portrayed as "outsiders" among integers.^[53]

See also

• Adleman–Pomerance–Rumely primality test
• Bonse's inequality
• Brun sieve
• Burnside theorem
• Chebotarev's density theorem
• Chinese remainder theorem
• Cullen number
• List of prime numbers
• Mersenne prime
• Multiplicative number theory
• Number field sieve
• Pepin's test
• Prime k-tuple
• Primon gas
• Quadratic residuosity problem
• RSA number
• Smooth number
• Woodall number

Notes

1. ^ Some sources also put $\left| q \right|_p := e^{-v_p(q)}. \,$.

1. ^ Dudley, Underwood (1978), Elementary number theory (2nd ed.), W. H. Freeman and Co., ISBN 978-0-7167-0076-0 , p. 10, section 2
2. ^ Dudley 1978, Section 2, Theorem 2
3. ^ Dudley 1978, Section 2, Lemma 5
4. ^ See, for example, David E. Joyce's commentary on Euclid's Elements, Book VII, definitions 1 and 2.
5. ^ Riesel 1994, p. 36
6. ^ Conway & Guy 1996, pp. 129–130
7. ^ Derbyshire, John (2003), "The Prime Number Theorem", Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, Washington, D.C.: Joseph Henry Press, p. 33, ISBN 9780309085496, OCLC 249210614 
8. ^ ""Arguments for and against the primality of 1".
9. ^ [1] "Why is the number one not prime?"
10. ^ The Largest Known Prime by Year: A Brief History Prime Curios!: 17014…05727 (39-digits)
11. ^ Letter in Latin from Goldbach to Euler, July 1730.
12. ^ Füstenberg 1955
13. ^ Ribenboim 2004, p. 4
14. ^ James Williamson (translator and commentator), The Elements of Euclid, With Dissertations, Clarendon Press, Oxford, 1782, page 63, English translation of Euclid's proof
15. ^ Hardy, Michael; Woodgold, Catherine (2009). "Prime Simplicity". Mathematical Intelligencer 31 (4): 44–52. 
16. ^ Apostol, Tom M. (1976), Introduction to Analytic Number Theory, Berlin, New York: Springer-Verlag, ISBN 978-0-387-90163-3 , Section 1.6, Theorem 1.13
17. ^ Apostol 1976, Section 4.8, Theorem 4.12
18. ^ (Lehmer 1909).
19. ^ "Record 12-Million-Digit Prime Number Nets $100,000 Prize". Electronic Frontier Foundation. October 14, 2009. http://www.eff.org/press/archives/2009/10/14-0. Retrieved 2010-01-04. 
20. ^ "EFF Cooperative Computing Awards". Electronic Frontier Foundation. http://www.eff.org/awards/coop. Retrieved 2010-01-04. 
21. ^ Chris K. Caldwell. "The Top Twenty: Factorial". Primes.utm.edu. http://primes.utm.edu/top20/page.php?id=30. Retrieved 2010-10-07. 
22. ^ Primegrid.com; official anouncement, 24 December 2010
23. ^ Chris K. Caldwell. "The Top Twenty: Twin Primes". Primes.utm.edu. http://primes.utm.edu/top20/page.php?id=1. Retrieved 2011-05-21. 
24. ^ Havil 2003, p. 171
25. ^ http://books.google.com/books?id=oLKlk5o6WroC&pg=PA13#v=onepage&q&f=false p. 15
26. ^ (Tom M. Apostol 1976), Section 4.6, Theorem 4.7
27. ^ (Ben Green & Terence Tao 2008).
28. ^ Hua (2009), p. 176-177"
29. ^ See list of values, calculated by Wolfram Alpha
30. ^ C. S. Ogilvy & J. T. Anderson Excursions in Number Theory, pp. 29–35, Dover Publications Inc., 1988 ISBN 0-486-25778-9
31. ^ Tomás Oliveira e Silva (2011-04-09). "Goldbach conjecture verification". Ieeta.pt. http://www.ieeta.pt/~tos/goldbach.html. Retrieved 2011-05-21. 
32. ^ Ramaré, O. (1995), "On šnirel'man's constant", Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV 22 (4): 645–706, http://www.numdam.org/item?id=ASNSP_1995_4_22_4_645_0, retrieved 2008-08-22. 
33. ^ Caldwell, Chris, The Top Twenty: Lucas Number at The Prime Pages.
34. ^ E.g., see Guy 1981, problem A3, pp. 7–8
35. ^ Tattersall, J.J. (2005), Elementary number theory in nine chapters, Cambridge University Press, ISBN 978-0-521-85014-8, http://books.google.de/books?id=QGgLbf2oFUYC , p. 112
36. ^ Weisstein, Eric W., "Landau's Problems" from MathWorld.
37. ^ Hardy 1940 "No one has yet discovered any warlike purpose to be served by the theory of numbers or relativity, and it seems unlikely that anyone will do so for many years."
38. ^ Goles, E.; Schulz, O.; Markus, M. (2001). "Prime number selection of cycles in a predator-prey model". Complexity 6 (4): 33–38. doi:10.1002/cplx.1040. 
39. ^ Paulo R. A. Campos, Viviane M. de Oliveira, Ronaldo Giro, and Douglas S. Galvão. (2004), "Emergence of Prime Numbers as the Result of Evolutionary Strategy", Physical Review Letters 93 (9): 098107, Bibcode 2004PhRvL..93i8107C, doi:10.1103/PhysRevLett.93.098107. 
40. ^ "Invasion of the Brood". The Economist. May 6, 2004. http://economist.com/PrinterFriendly.cfm?Story_ID=2647052. Retrieved 2006-11-26. 
41. ^ Ivars Peterson (June 28, 1999). "The Return of Zeta". MAA Online. http://www.maa.org/mathland/mathtrek_6_28_99.html. Retrieved 2008-03-14. 
42. ^ Lang, Serge (2002), Algebra, Graduate Texts in Mathematics, 211, Berlin, New York: Springer-Verlag, ISBN 978-0-387-95385-4, MR1878556 , Section II.1, p. 90
43. ^ Schubert, H. "Die eindeutige Zerlegbarkeit eines Knotens in Primknoten". S.-B Heidelberger Akad. Wiss. Math.-Nat. Kl. 1949 (1949), 57–104.
44. ^ Eisenbud 1995, section 3.3.
45. ^ Shafarevich, Basic Algebraic Geometry volume 2 (Schemes and Complex Manifolds), p. 5, section V.1
46. ^ Neukirch, Algebraic Number theory, p. 50, Section I.8
47. ^ Neukirch, Algebraic Number theory, p. 38, Section I.7
48. ^ Endler, Valuation Theory, p. 1
49. ^ Gouvea: p-adic numbers: an introduction, Chapter 3, p. 43
50. ^ Hill, ed. 1995
51. ^ Carl Pomerance, Prime Numbers and the Search for Extraterrestrial Intelligence, Retrieved on December 22, 2007
52. ^ The music of primes, Marcus du Sautoy's selection of films featuring prime numbers.
53. ^ "Introducing Paolo Giordano". Books Quarterly. http://www.wbqonline.com/feature.do?featureid=342. ^{[dead link]}

References

• Apostol, Thomas M. (1976), Introduction to Analytic Number Theory, New York: Springer, ISBN 0-387-90163-9 
• Conway, John Horton; Guy, Richard K. (1996), The Book of Numbers, New York: Copernicus, ISBN 978-0-387-97993-9 
• Crandall, Richard; Pomerance, Carl (2005), Prime Numbers: A Computational Perspective (2nd ed.), Berlin, New York: Springer-Verlag, ISBN 978-0-387-25282-7 
• Derbyshire, John (2003), Prime obsession, Joseph Henry Press, Washington, DC, ISBN 978-0-309-08549-6, MR1968857 
• Eisenbud, David (1995), Commutative algebra, Graduate Texts in Mathematics, 150, Berlin, New York: Springer-Verlag, ISBN 978-0-387-94268-1, MR1322960 
• Furstenberg, Harry (1955), "On the infinitude of primes", The American Mathematical Monthly (Mathematical Association of America) 62 (5): 353, doi:10.2307/2307043, JSTOR 2307043 
• Green, Ben; Tao, Terence (2008), "The primes contain arbitrarily long arithmetic progressions", Annals of Mathematics 167 (2): 481–547, arXiv:math.NT/0404188, doi:10.4007/annals.2008.167.481 
• Gowers, Timothy (2002), Mathematics: A Very Short Introduction, Oxford University Press, ISBN 978-0-19-285361-5 
• Guy, Richard K. (1981), Unsolved Problems in Number Theory, Berlin, New York: Springer-Verlag, ISBN 978-0-387-90593-8 
• Havil, Julian (2003), Gamma: Exploring Euler's Constant, Princeton University Press, ISBN 978-0-691-09983-5 
• Hardy, Godfrey Harold (1908), A Course of Pure Mathematics, Cambridge University Press, ISBN 978-0-521-09227-2 
• Hardy, Godfrey Harold (1940), A Mathematician's Apology, Cambridge University Press, ISBN 978-0-521-42706-7 
• Hill, Peter Jensen, ed. (1995), The Messiaen companion, Portland, Or: Amadeus Press, ISBN 978-0-931340-95-6 
• Hua, L. K. (2009), Additive Theory of Prime Numbers, Translations of Mathematical Monographs, 13, AMS Bookstore, ISBN 978-0-8218-4942-2, http://www.ams.org/bookstore-getitem/item=MMONO/13.S 
• Lehmer, D. H. (1909), Factor table for the first ten millions containing the smallest factor of every number not divisible by 2, 3, 5, or 7 between the limits 0 and 10017000, Washington, D.C.: Carnegie Institution of Washington 
• Narkiewicz, Wladyslaw (2000), The development of prime number theory: from Euclid to Hardy and Littlewood, Springer Monographs in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-3-540-66289-1 
• Ribenboim, Paulo (2004), The little book of bigger primes, Berlin, New York: Springer-Verlag, ISBN 978-0-387-20169-6 
• Riesel, Hans (1994), Prime numbers and computer methods for factorization, Basel, Switzerland: Birkhäuser, ISBN 978-0-8176-3743-9 
• Sabbagh, Karl (2003), The Riemann hypothesis, Farrar, Straus and Giroux, New York, ISBN 978-0-374-25007-2, MR1979664 
• du Sautoy, Marcus (2003), The music of the primes, HarperCollins Publishers, ISBN 978-0-06-621070-4, MR2060134, http://www.musicoftheprimes.com/ 

Further references

• Kelly, Katherine E., ed. (2001), The Cambridge companion to Tom Stoppard, Cambridge University Press, ISBN 978-0-521-64592-8 
• Stoppard, Tom (1993), Arcadia, London: Faber and Faber, ISBN 978-0-571-16934-4 

External links

• Caldwell, Chris, The Prime Pages at primes.utm.edu.
• Prime Numbers on In Our Time at the BBC.
• An Introduction to Analytic Number Theory, by Ilan Vardi and Cyril Banderier
• Plus teacher and student package: prime numbers from Plus, the free online mathematics magazine produced by the Millennium Mathematics Project at the University of Cambridge

Prime number generators and calculators

• Prime Number Checker identifies the smallest prime factor of a number
• Fast Online primality test — Dario Alpern's personal site – Makes use of the Elliptic Curve Method (up to thousands digits numbers check!, requires Java)
• Prime Number Generator — Generates a given number of primes above a given start number.
• Huge database of prime numbers