arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.02500math.NT
收藏

Andrica猜想的变体:有无黎曼假设下的情形

Variants on Andrica's conjecture with and without the Riemann hypothesis

Matt Visser

AI总结:

本文研究Andrica猜想的变体,在黎曼假设下证明对数修正和m次根形式的显式界,并给出无条件结果及验证区域的更新。

摘要:

关于素数分布的显式证明与猜想之间的差距是巨大的。众所周知(且合理),黎曼假设不足以证明Andrica猜想:对所有$n\geq 1$,是否有$\sqrt{p_{n+1}}-\sqrt{p_n} \leq 1$?但至少能否得到接近的结果?我将首先证明,在假设黎曼假设的前提下,通过一个对数修正,有\\[ {\sqrt{p_{n+1}}\over\ln p_{n+1}} -{\sqrt{p_n}\over\ln p_n} < {11\over25}; \qquad (n\geq1). \\] 然后,通过考虑更一般的$m$次根,同样假设黎曼假设,我将证明\\[ {\sqrt[m]{p_{n+1}}} -{\sqrt[m]{p_n}} < {44\over25 \\,e\\, (m-2)}; \qquad (n\geq 3;\\; m >2). \\] 作为对比,如果我们局限于目前能无条件证明的结果,那么仅有的显式Andrica型结果似乎是以下结果的变体:\\[ \ln^2 p_{n+1} - \ln^2 p_n < 9; \qquad (n\geq1). \\] \\[ \ln^3 p_{n+1} - \ln^3 p_n < 52; \qquad (n\geq1). \\] \\[ \ln^4 p_{n+1} - \ln^4 p_n < 991; \qquad (n\geq1). \\] 我还将略微更新Andrica猜想被无条件验证的区域。

英文摘要:

The gap between what we can explicitly prove regarding the distribution of primes and what we suspect regarding the distribution of primes is enormous. It is (reasonably) well-known that the Riemann hypothesis is not sufficient to prove Andrica's conjecture: $\forall n\geq 1$, is $\sqrt{p_{n+1}}-\sqrt{p_n} \leq 1$? But can one at least get tolerably close? I shall first show that with a logarithmic modification, provided one assumes the Riemann hypothesis, one has \[ {\sqrt{p_{n+1}}\over\ln p_{n+1}} -{\sqrt{p_n}\over\ln p_n} < {11\over25}; \qquad (n\geq1). \] Then, by considering more general $m^{th}$ roots, again assuming the Riemann hypothesis, I shall show that \[ {\sqrt[m]{p_{n+1}}} -{\sqrt[m]{p_n}} < {44\over25 \,e\, (m-2)}; \qquad (n\geq 3;\; m >2). \] In counterpoint, if we limit ourselves to what we can currently prove unconditionally, then the only explicit Andrica-like results seem to be variants on the results below: \[ \ln^2 p_{n+1} - \ln^2 p_n < 9; \qquad (n\geq1). \] \[ \ln^3 p_{n+1} - \ln^3 p_n < 52; \qquad (n\geq1). \] \[ \ln^4 p_{n+1} - \ln^4 p_n < 991; \qquad (n\geq1). \] I shall also slightly update the region on which Andrica's conjecture is unconditionally verified.

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

↑