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

几乎素数之间的小间隔、奇偶性问题和连续整数上Erdom的一些证明II

Small gaps between almost primes, the parity problem, and some conjectures of Erdős on consecutive integers II

Daniel A. Goldston, Sidney W. Graham, Apoorva Panidapu, Janos Pintz, Jordan Schettler, Cem Y. Yıldırım

摘要:

这篇论文是由这里的四位合著者撰写的论文arXiv:0803.2636的续集。在这篇论文中,他们证明了一个更强形式的Erdens-Mirksy猜想,该猜想指出存在无穷多个正整数$x$使得$d(x)=d(x+1)$其中$d(x)$表示$x$的约数。这个猜想首先由Heath-Brown在1984年证明,但是该方法没有揭示这样的$x$的值集$d(x)$的性质。特别地,不能得出结论,存在$d(x)=d(x+1)=A$无限频繁的任何特定值$A$。在之前的论文arXiv:0803.2636中,作者证明了存在无穷多个正整数$x$,使得$x$和$x+1$都具有指数模式$\{2,1,1,1\}$,所以$d(x)=d(x+1)=24$。对于某些移位$n$,已知类似的结果,即,$x$和$x+n$具有相同的固定指数模式的频率是无限的。这是做的移位$n$是甚至或不能整除的产品的一对孪生素数。本文的目的是给出关于任意移位$n$的指数模式的结果的简单证明。

英文摘要:

This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erdős-Mirksy conjecture which states that there are infinitely many positive integers $x$ such that $d(x)=d(x+1)$ where $d(x)$ denotes the number of divisors of $x$. This conjecture was first proven by Heath-Brown in 1984, but the method did not reveal the nature of the set of values $d(x)$ for such $x$. In particular, one could not conclude that there was any particular value $A$ for which $d(x)=d(x+1)=A$ infinitely often. In the previous paper arXiv:0803.2636, the authors showed that there are infinitely many positive integers $x$ such that both $x$ and $x+1$ have exponent pattern $\{2,1,1,1\}$, so $d(x)=d(x+1)=24$. Similar results were known for certain shifts $n$, i.e., $x$ and $x+n$ have the same fixed exponent pattern infinitely often. This was done for shifts $n$ which are either even or not divisible by the product of a pair of twin primes. The goal of this paper is to give simple proofs of results on exponent patterns for an arbitrary shift $n$.

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

↑