Bertrand's postulate is a classical statement in elementary number theory asserting that for every integer n > 1 there exists at least one prime number p satisfying n < p < 2n. The claim guarantees that primes never become arbitrarily sparse on the scale of doubling: between any positive integer and its double there is always a prime. In historical sources Bertrand phrased the assertion for n > 3 and verified many cases by computation; the modern convenient formulation is for n > 1.

Precise statement and simple examples

The commonly used form of the theorem is:

  • For every integer n > 1 there exists a prime p with n < p < 2n.

Examples: for n=2 the prime 3 lies between 2 and 4; for n=10 the prime 11 lies between 10 and 20. The statement is nontrivial because gaps between consecutive primes can grow larger as numbers increase, yet this result prohibits gaps of length at least n in the interval (n,2n).

History and development

The conjecture was proposed in 1845 by the French mathematician Joseph Bertrand, who checked the claim by hand for all numbers up to about three million. A full proof was given in 1850 by Pafnuty Chebyshev, so the result is often called the Bertrand–Chebyshev theorem or simply Chebyshev's theorem. Later mathematicians produced alternate proofs and refinements: the Indian mathematician Srinivasa Ramanujan found a shorter argument that led him to define what are now known as Ramanujan primes, and in 1932 Paul Erdős published a notably elementary and concise proof.

Sketches of proof ideas

Although the original proof used analytic estimates, several different methods yield the result or stronger forms:

  • Chebyshev's approach used inequalities for functions that encode the distribution of primes (Chebyshev functions) and gave effective bounds on factorials and prime powers.
  • Ramanujan's proof simplified some of Chebyshev's estimates and introduced bounds that inspired the definition of Ramanujan primes, which quantify how large n must be to guarantee several primes in (n,2n].
  • Erdős produced a short elementary proof based on properties of the central binomial coefficient C(2n,n) and estimates for how primes divide combinatorial numbers; his argument avoids complex analysis and demonstrates the existence of a prime in (n,2n) by contradiction.

Significance and consequences

Bertrand's postulate is useful as a simple, effective guarantee of primes in short intervals and appears in many arguments in elementary number theory and combinatorics. It serves as a stepping stone in proofs that require the existence of a prime of comparable size to a given integer. From the modern viewpoint, the Prime Number Theorem (proved near the end of the 19th century) implies much stronger regularity in the distribution of primes and shows that for large n there are on the order of n/log n primes up to n, so many primes lie between n and 2n. Still, Bertrand's postulate provides a concrete nonasymptotic statement with elementary proofs and explicit small-case verification.

Refinements and generalizations

There are a number of stronger results and related concepts. For example, research has produced explicit bounds guaranteeing primes in narrower subintervals for sufficiently large n (classical improvements include results by Nagura and later refinements). The notion of Ramanujan primes quantifies how large n must be so that there are at least k primes between n and 2n. Many elementary and analytic techniques developed around Bertrand's postulate continue to be instructive tools in studying prime gaps and the fine structure of the prime sequence.

For further reading on the original computations and proofs consult standard number theory surveys and biographies of the contributors: Bertrand, Ramanujan, and Erdős provide historical perspectives, while introductions to prime distribution discuss Chebyshev's inequalities and the Chebyshev functions used in early proofs.