| 释义 |
Bertrand's postulate For any positive integer n, there is always at least one prime number p satisfying n < p ≤ 2n. For example, for n = 7 the prime 11 lies between 7 and 14. This was conjectured by Bertrand in 1845 and proved by Chebyshev in 1850.
|