Theoremintro
Bertrand's postulate
Also called Chebyshev-Erdős theorem.
For every n > 1 there is a prime p with n < p ≤ 2n.
For every n > 1 there is a prime p with n < p ≤ 2n.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag ZDPRG9 Edit this page History Report an error