Arithmetic functions at consecutive shifted primes

From MaRDI portal



Abstract: For each of the functions finphi,sigma,omega,au and every natural number k, we show that there are infinitely many solutions to the inequalities f(pn−1)<f(pn+1−1)<dots<f(pn+k−1), and similarly for f(pn−1)>f(pn+1−1)>dots>f(pn+k−1). We also answer some questions of Sierpi'nski 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.











This page was built for publication: Arithmetic functions at consecutive shifted primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942522)