Abstract
The average order of the Euler function ϕ(n), the number of integers less than n which are relatively prime to n, raises many difficult and still unanswered questions. Thus, for1.1,and1.2,it is known that R(x) = O(x log x) and H(x) = O(log x). However, though these results are quite old, they were not improved until recently.
Publisher
Canadian Mathematical Society
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献