Affiliation:
1. Dép. de mathématiques et de statistique, Université Laval, Québec, Canada
2. Computer Algebra Department Eötvös Loránd University Budapest, Hungary
Abstract
Let ? stand for the Euler function. Given a positive integer n, let ?(n) stand for the sum of the positive divisors of n and let ?(n) be the number of divisors of n. We obtain an asymptotic estimate for the counting function of the set {n : gcd (?(n), ?(n)) = gcd(?(n), ?(n)) = 1}. Moreover, setting l(n) : = gcd(?(n), ?(n+1)), we provide an asymptotic estimate for the size of #{n ? x: l(n) = 1}.
Publisher
National Library of Serbia
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the numbers relatively prime to Ω()-();Proceedings of the American Mathematical Society;2022-04-29
2. Arithmetic functions and their coprimality;Functiones et Approximatio Commentarii Mathematici;2011-09-01