Preprint in the OpenAI Math release
An asymptotic formula for the number of totients
OpenAI
Abstract
Let count the distinct values of Euler's totient function up to x. We give an explicit asymptotic equivalent for . Its coefficient is a uniform limit of functions defined from finite arithmetic data. We also prove that as for every fixed c > 0, answering a question of Erdős and Hall.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.