Asymptotic formula for the totient sum over prime quotients
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.
References
- Kota Saito, Yuta Suzuki, Wataru Takeda and Yuuya Yoshida, “Some remarks on the [x/n]-sequence”, arXiv:2312.15642 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.