An Erdos-Kac theorem for Smooth and Ultra-Smooth integers

Abstract

We prove an Erdos-Kac type of theorem for the set S(x,y)=\n≤ x: p|n ⇒ p≤ y \. If ω (n) is the number of prime factors of n, we prove that the distribution of ω(n) for n ∈ S(x,y) is Gaussian for a certain range of y using method of moments. The advantage of the present approach is that it recovers classical results for the range u=o( x ) where u= x y, with a much simpler proof.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…