请输入您要查询的字词:

 

单词 Bertrand’s postulate
释义
Bertrand’s postulate

Mathematics
  • For any positive integer n, there is always at least one prime number p satisfying n < p ≤  2n. For example, for n = 7 the prime 11 lies between 7 and 14. This was conjectured by Bertrand in 1845 and proved by Chebyshev in 1852.


随便看

 

科学参考收录了60776条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/6 5:20:44