Abstract
Let ω(n) is the number of distinct prime factors of the natural number n; we consider two cases where l is even and odd natural numbers, and then we prove a more general form of the classical 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
