On the number of distinct exponents in the prime factorization of an integer

Abstract

Let f(n) be the number of distinct exponents in the prime factorization of the natural number n. We prove some results about the distribution of f(n). In particular, for any positive integer k, we obtain that \#\n ≤ x : f(n) = k\ Ak x and \#\n ≤ x : f(n) = ω(n) - k\ B x ( x)kk! x , as x +∞, where ω(n) is the number of prime factors of n and Ak, B > 0 are some explicit constants. The latter asymptotic extends a result of Aktas and Ram Murty about numbers having mutually distinct exponents in their prime factorization.

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…