Bertrand's postulate
Postulado de Bertrand
- Date
- 1845 (probado en 1852) · confidence high
- Place
- Paris, France
- Credited to
- Joseph Bertrand; proved by Pafnuty Chebyshev
- Field
- Knowledge & symbols
What was discovered
Bertrand conjectured in 1845, after verifying it up to three million, that there is always at least one prime number between n and 2n for every integer n>3; Chebyshev proved it in 1852, so it is also known as the Bertrand–Chebyshev theorem.
What it led to
- Explicit bounds on the distribution of prime numbers
- Basis for later proofs such as Erdős's (1932) using binomial coefficients