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

连续移位素数的算术函数

Arithmetic functions at consecutive shifted primes

Paul Pollack, Lola Thompson

摘要:

对于每个函数$f \in \{ϕ, σ, ω, τ\}$和每个自然数$k$,我们证明了不等式$f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$有无穷多个解,对于$f(p_n-1) > f(p_{n+1}-1) > \dots > f(p_{n+k}-1)$也是如此.我们还回答了Sierpienski关于连续素数的数位和的一些问题。这些论点基本上利用梅纳德和陶的方法产生许多素数的区间有界长度。

英文摘要:

For each of the functions $f \in \{ϕ, σ, ω, τ\}$ and every natural number $k$, we show that there are infinitely many solutions to the inequalities $f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$, and similarly for $f(p_n-1) > f(p_{n+1}-1) > \dots > f(p_{n+k}-1)$. We also answer some questions of Sierpiński on the digit sums of consecutive primes. The arguments make essential use of Maynard and Tao's method for producing many primes in intervals of bounded length.

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

↑