最終更新日：2024/07/29
(mathematics) the theorem that there is at least one prime number between n and 2n for every n>1, i.e.:
正解を見る
Bertrand-Chebyshev theorem
編集履歴（0）
(mathematics) the theorem that there is at least one prime number between n and 2n for every n>1, i.e.:
Bertrand-Chebyshev theorem
DiQt（ディクト）
無料
★★★★★★★★★★
