chebyshevs theorem
Assuming "chebyshevs theorem" is referring to a mathematical result | Use as instead

Input interpretation

Bertrand's postulate (mathematical problem)

Statement

Bertrand's postulate posits that if n>3, then there is always at least one prime between n and 2n - 2.

Formal statement

for all _(n element Z, n>3)exists_(m element Z^+)n<p_m<2n - 2

Alternate names

Bertrand-Chebyshev theorem | Chebyshev-Bertand theorem | Chebyshev's theorem
POWERED BY THE WOLFRAM LANGUAGE