Linked from

The 10 pages that link to Bertrand's postulate, each with the reason it gives.

• Prime number theoremRelated: It gives a concrete interval guarantee, unlike the theorem's asymptotic density estimate.

• Prime-counting functionRelated: It guarantees a minimum increase in prime counts across doubled intervals.

• Prime gapsRelated: It guarantees that consecutive primes cannot remain too far apart on a multiplicative scale.

• Constructive proofBroader topic: Constructive proofs of this bound can provide explicit ways to locate such a prime.

• Euclid's theoremRelated: It strengthens mere infinitude by guaranteeing primes within bounded intervals.

• Legendre's conjectureCompared with: It guarantees primes in shorter multiplicative ranges, but not specifically between consecutive squares.

• Pafnuty ChebyshevRelated: Chebyshev proved the postulate, using estimates on prime numbers.

• Bonse's inequalityRelated: Prime-gap bounds such as this help control the next prime in inequalities involving primorials.

• Brocard's conjectureCompared with: It guarantees one prime in a shorter multiplicative range, while Brocard's conjecture demands four in a different interval.

• Grimm's conjectureCompared with: It concerns primes near integers, while Grimm's conjecture assigns divisors to composites.