Bertrand's postulate

From Wikipedia Mirror

Bertrand's postulate (actually a theorem) states that if n > 3 is an integer, then there always exists at least one prime number p with n < p < 2n − 2. A weaker but more elegant formulation is: for every n > 1 there is always at least one prime p such that n < p < 2n.

This statement was first conjectured in 1845 by Joseph Bertrand (1822–1900). Bertrand himself verified his statement for all numbers in the interval [2, 3 × 10⁶]. His conjecture was completely proved by Chebyshev (1821–1894) in 1850 and so the postulate is also called the Bertrand-Chebyshev theorem or Chebyshev's theorem. Ramanujan (1887–1920) used properties of the Gamma function to give a simpler proof [1], from which the concept of Ramanujan primes would later arise, and Erdős (1913–1996) in 1932 published a simpler proof using the Chebyshev function <math>\vartheta(x)</math>, defined as:

<math> \vartheta(x) = \sum_{p=2}^{x} \ln (p) </math>

where p ≤ x runs over primes, and the binomial coefficients. See proof of Bertrand's postulate for the details.

Contents 1 Sylvester's theorem 2 Erdős's theorems 3 Better results 4 References

Sylvester's theorem

Bertrand's postulate was proposed for applications to permutation groups. Sylvester (1814–1897) generalized it with the statement: the product of k consecutive integers greater than k is divisible by a prime greater than k.

Erdős's theorems

Erdős proved that for any positive integer k, there is a natural number N such that for all n > N, there are at least k primes between n and 2n. An equivalent statement had been proved earlier by Ramanujan (see Ramanujan prime).

The prime number theorem (PNT) implies that the number of primes up to x is roughly x/log(x), so if we replace x with 2x then we see the number of primes up to 2x is asymptotically twice the number of primes up to x (the terms log(2x) and log(x) are asymptotically equivalent). Therefore the number of primes between n and 2n is roughly n/log(n) when n is large, and so in particular there are many more primes in this interval than are guaranteed by Bertrand's Postulate. So Bertrand's postulate is comparatively weaker than the PNT. But PNT is a deep theorem, while Bertrand's Postulate can be stated more memorably and proved more easily, and also makes precise claims about what happens for small values of n. (In addition, Chebyshev's theorem was proved before the PNT and so has historical interest.)

The similar and still unsolved Legendre's conjecture asks whether for every n > 1, there is a prime p, such that n² < p < (n + 1)². Again we expect that there will be not just one but many primes between n² and (n + 1)², but in this case the PNT doesn't help: the number of primes up to x² is asymptotic to x²/log(x²) while the number of primes up to (x+1)² is asymptotic to (x+1)²/log((x+1)²), which is asymptotic to the estimate on primes up to x². So unlike the previous case of x and 2x we don't get a proof of Legendre's conjecture even for all large n. Error estimates on the PNT are not (indeed, cannot be) sufficient to prove the existence of even one prime in this interval.

Better results

It follows from the prime number theorem that for any <math>k>1</math>, there exists a sufficiently large <math>n_0</math> such that there is always a prime between <math>n</math> and <math>kn</math> for all <math>n>n_0</math>: it can be shown, for instance, that as <math>n \to \infty</math>, <math>\frac{\pi(kn)-\pi(n)}{n/\log n} \to (k-1)</math>, which means that <math>\pi(kn)-\pi(n) \to \infty</math> (and in particular is greater than 1 for sufficiently large <math>n</math>).

Non-asymptotic bounds have been also been proved. In 1952, Jitsuro Nagura proved that for <math>n>24</math>, there is always a prime between n and <math>(1+1/5)n</math>.^[1]

In 1976, Lowell Schoenfeld showed that for <math>n\ge2010760</math>, there is always a prime between n and <math>(1+1/16597)n</math>.^[1] In 1998, Pierre Dusart improved the result in his doctoral thesis, showing that for <math>k \ge 463</math>, <math>p_{k+1} \le p_k \left(1 + \frac{1}{2\ln^2 p_k}\right)</math>, and in particular for <math>x \ge 3275</math>, there exists a prime number between <math>x</math> and <math>x\left(1 + \frac{1}{2\ln^2 x}\right)</math>.^[1]

References

• Template:Cite journal
• Template:Cite journal
• Template:MathWorld
• Chris Caldwell, Bertrand's postulate at Prime Pages glossary.
• Template:Cite book
• Template:Cite bookca:Postulat de Bertrand

cs:Bertrandův postulát es:Postulado de Bertrand fr:Postulat de Bertrand ko:베르트랑 공준 it:Postulato di Bertrand nl:Postulaat van Bertrand ja:ベルトランの仮説 pl:Postulat Bertranda pt:Postulado de Bertrand ru:Постулат Бертрана simple:Bertrand's postulate sl:Bertrandova domneva sr:Бертранов постулат fi:Tšebyšovin lause th:สัจพจน์ของเบอร์แทรนด์ vi:Định đề Bertrand zh:伯特蘭-切比雪夫定理