I am trying to estimate the asymptotics of the number $N(m,n)$ of coprime integers where one of the integers is at most $m$ and the other is at most $n$. What I obtained looks as follows: $$ N(m,n) = \frac{6}{\pi^2}mn + O(\max(m,n) \log (\max(m,n))) $$ I wonder if there exists an estimation with a $o(mn)$ error term.

  • $\begingroup$ With elementary functions, I guess. Otherwise you have the trivial $N(n,m)=N(n,m)+o(mn)$ $\endgroup$ – ajotatxe May 9 at 16:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.