arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0904.0473math.NTmath.PR
收藏

素数链和Pratt树

Prime chains and Pratt trees

Kevin Ford, Sergei V. Konyagin, Florian Luca

摘要:

本文研究了素数链的分布,素数链是序列p_1,…,p_k的素数,对于每个j,p_{j+1} \equiv 1 \pmod{p_j}.我们给出了p_k \le x(k变量)的链的个数,以及p_1 =p和p_k \le px的链的个数的估计.本文的大部分内容都是关于H(p)的分布,H(p)是p_k=p的最长链的长度,也是p的Pratt树的高度。我们证明了H(p)\ge c \log \log p和H(p)\le(\log p)^{1-c '}对几乎所有p,c,c'为显式正常数。对于任何ε>0,我们可以假定c=e-ε,假设Elliott-Halbernut猜想。介绍并分析了基于分枝随机游动的Pratt树的随机模型。该模型表明,对于大多数p,H(p)非常接近e \log \log p。

英文摘要:

We study the distribution of prime chains, which are sequences p_1,...,p_k of primes for which p_{j+1}\equiv 1\pmod{p_j} for each j. We give estimates for the number of chains with p_k\le x (k variable), and the number of chains with p_1=p and p_k \le px. The majority of the paper concerns the distribution of H(p), the length of the longest chain with p_k=p, which is also the height of the Pratt tree for p. We show H(p)\ge c\log\log p and H(p)\le (\log p)^{1-c'} for almost all p, with c,c' explicit positive constants. We can take, for any ε>0, c=e-εassuming the Elliott-Halberstam conjecture. A stochastic model of the Pratt tree, based on a branching random walk, is introduced and analyzed. The model suggests that for most p, H(p) stays very close to e \log\log p.

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

↑