请输入您要查询的字词:

 

单词 Erdős conjecture
释义
Erdős conjecture

Mathematics
  • The conjecture that if a subset S of the positive integers satisfies

    nS1n=,

    then the set S contains arbitrarily long arithmetic progressions. The conjecture is unproven. The Green-Tao theorem proves the conjecture true in the special case when S is the set of prime numbers.


随便看

 

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

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2025/2/6 1:58:06