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

Gilbreath猜想的一个随机模拟

A random analogue of Gilbreath's conjecture

Zachary Chase

摘要:

一个著名的猜想Gilbreath,独立Proth从19世纪,指出,如果$a_{0,n} = p_n$表示$n^{\text{th}}$素数和$a_{i,n} = |a_{i-1,n}-a_{i-1,n+1}|$的$i, n \ge 1$,那么$a_{i,1} = 1$的所有$i \ge 1$。已经反复假设,如果间隙$a_{0,n+1}-a_{0,n}$不太大并且足够随机,则对于初始$(a_{0,n})_{n \ge 1}$的任何选择,具有足够大的$a_{i,1} = 1$的性质都应该成立。我们证明了这个假设的(一个精确形式)。

英文摘要:

A well-known conjecture of Gilbreath, and independently Proth from the 1800s, states that if $a_{0,n} = p_n$ denotes the $n^{\text{th}}$ prime number and $a_{i,n} = |a_{i-1,n}-a_{i-1,n+1}|$ for $i, n \ge 1$, then $a_{i,1} = 1$ for all $i \ge 1$. It has been postulated repeatedly that the property of having $a_{i,1} = 1$ for $i$ large enough should hold for any choice of initial $(a_{0,n})_{n \ge 1}$ provided that the gaps $a_{0,n+1}-a_{0,n}$ are not too large and are sufficiently random. We prove (a precise form of) this postulate.

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

↑