On the number of prime factors of values of the sum-of-proper-divisors function

preprint2015arXivOpen access

Abstract

Let ω(n)ω(n) (resp. Ω(n)Ω(n)) denote the number of prime divisors (resp. with multiplicity) of a natural number nn. In 1917, Hardy and Ramanujan proved that the normal order of ω(n)ω(n) is log⁡log⁡n\log\log n, and the same is true of Ω(n)Ω(n); roughly speaking, a typical natural number nn has about log⁡log⁡n\log\log n prime factors. We prove a similar result for ω(s(n))ω(s(n)), where s(n)s(n) denotes the sum of the proper divisors of nn: For any ε>0ε> 0 and all n≤xn \leq x not belonging to a set of size o(x)o(x), ∣ω(s(n))−log⁡log⁡s(n)∣<εlog⁡log⁡s(n) |ω(s(n)) - \log\log s(n)| < ε\log\log s(n) and the same is true for Ω(s(n))Ω(s(n)).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.