Asymptotic formula for the totient sum over prime quotients
Statement
Let run over primes, let denote Euler's totient function, and let denote the integer part of . As , consider the sum
Asymptotic formula.
The preceding theorem gives upper and lower bounds with constants differing from by fixed multiples of and , respectively. The authors state that proving the asymptotic formula is currently out of reach because of difficulties in estimating the relevant exponential sums.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.