arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0811.4451math.NT
收藏

迈向证明勒让德猜想

Towards Proving Legendre's Conjecture

Shiva Kintali

AI总结:

研究对于大于1的整数n和固定整数k≤n,是否存在质数p使kn < p < (k + 1)n,基于埃尔德什对伯特兰-切比雪夫定理的证明,用初等组合技术明确确定N(k),使n >= N(k)时kn与(k + 1)n间至少有一个质数。

摘要:

勒让德猜想指出,对于每个正整数n,在n²与(n + 1)²之间存在一个质数。本文考虑问题:对于所有大于1的整数n和固定整数k≤n,是否存在质数p使得kn < p < (k + 1)n?伯特兰-切比雪夫定理对k = 1给出肯定回答。若k = n时答案为肯定则可证明勒让德猜想。本文表明能明确确定一个数N(k),使得对所有n >= N(k),在kn与(k + 1)n之间至少有一个质数。证明基于埃尔德什对伯特兰-切比雪夫定理的证明,采用初等组合技术,不诉诸素数定理。

英文摘要:

Legendre's conjecture states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. We consider the following question : for all integer n>1 and a fixed integer k<=n does there exist a prime number such that kn < p < (k+1)n ? Bertrand-Chebyshev theorem answers this question affirmatively for k=1. A positive answer for k=n would prove Legendre's conjecture. In this paper, we show that one can determine explicitly a number N(k) such that for all n >= N(k), there is at least one prime between kn and (k+1)n. Our proof is based on Erdos's proof of Bertrand-Chebyshev theorem and uses elementary combinatorial techniques without appealing to the prime number theorem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑