Bertrand-Chebyshev theorem
Bertrand-Chebyshev theorem proper noun: the theorem that there is at least one prime number between n and 2n for every n>1, i.e.
Proper noun
Bertrand-Chebyshev theorem
- the theorem that there is at least one prime number between n and 2n for every n>1, i.e.
- ∀n∈ℕ:n>1⇒∃p∈ℙ:n<p<2n
Origin of Bertrand-Chebyshev theorem
From the surname of Joseph Louis François Bertrand, who conjectured the theorem, and the surname of Pafnuty Chebyshev who proved it.
Questions about Bertrand-Chebyshev theorem
- What does Bertrand-Chebyshev theorem mean?
- Bertrand-Chebyshev theorem means the theorem that there is at least one prime number between n and 2n for every n>1, i.e.
- What part of speech is Bertrand-Chebyshev theorem?
- Bertrand-Chebyshev theorem is a proper noun.
Words near Bertrand-Chebyshev theorem in the dictionary
Source and license
Adapted from Wiktionary: Bertrand-Chebyshev theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Bertrand-Chebyshev theorem.” Word.ws, https://word.ws/bertrand-chebyshev_theorem. Based on Wiktionary, CC BY-SA 4.0.
