Abstract
Let ω(n) denote the number of distinct prime factors of n and let τk(n) denote the k-fold divisor function. Adapting a method of Granville and Soundararajan, we evaluate the centralized moments of ω(n), weighted by τk(n), and deduce a weighted version of the Erdős–Kac Theorem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
