| Definitions | | Bertrand-Chebyshev theorem |
|
noun
- (context, mathematics) the theorem that there is at least one prime number between n and 2n for every n>1, i.e.:
- <math>\forall n\in\mathbb{N}:n>1\Rightarrow\exists p\in\mathbb{P}:n<p<2n</math>
Etymology: From surname of w:Joseph Louis Franíois Bertrand, Joseph Louis Franíois Bertrand, who conjectured the theorem and surname of w:Pafnuty Chebyshev, Pafnuty Chebyshev who proved it.
Supplemental Details:Sponsor an extended definition for Bertrand-Chebyshev theorem for as little as $10 per month. Click here to contact us.
| |
|
