2000 character limit reached
Multiplicative Functions on Shifted Primes
Published 7 Apr 2021 in math.NT | (2104.03358v2)
Abstract: Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists a real number $c>0$ such that the $k$-tuples $(f(p+1),\ldots,f(p+k))$ are dense in the hypercube $[0,c]k$ or in $[c,+\infty)k$. In particular, the values $f(p+1),\ldots,f(p+k)$ can be put in any increasing order infinitely often. Our work generalises previous results of De Koninck and Luca.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.