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

稀疏集合中的例外特征与素数

Exceptional characters and prime numbers in sparse sets

Jori Merikoski

AI总结:

本文在假设有无穷多个例外特征的前提下提出素数下界筛法,以更少算术信息获得非平凡下界,并据此证明形如 $a^2+b^8$ 的素数有无穷多个。

摘要:

我们在存在无穷多个例外特征这一(不太可能成立的)假设下,发展了一种用于素数的下界筛法。与 Friedlander 和 Iwaniec 提出的、可产生渐近公式的虚幻筛法相比,我们证明证明非平凡下界所需的算术信息更少。作为该方法的应用,在假设存在无穷多个例外特征的情况下,我们证明存在无穷多个形如 $a^2+b^8$ 的素数。

英文摘要:

We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less arithmetic information is required to prove non-trivial lower bounds. As an application of our method, assuming the existence of infinitely many exceptional characters we show that there are infinitely many primes of the form $a^2+b^8$.

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

↑