arXiv:1902.09224 [math.NT]AbstractReferencesReviewsResources
On the number of distinct exponents in the prime factorization of an integer
Published 2019-02-25Version 1
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 \leq x : f(n) = k\} \sim A_k x $$ and $$ \#\{n \leq x : f(n) = \omega(n) - k\} \sim \frac{B x (\log \log x)^k}{k! \log x} , $$ as $x \to +\infty$, where $\omega(n)$ is the number of prime factors of $n$ and $A_k, B > 0$ are some explicit constants. The latter asymptotic extends a result of Akta\c{s} and Ram Murty about numbers having mutually distinct exponents in their prime factorization.
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2005.02027 [math.NT] (Published 2020-05-05)
Distance between natural numbers based on their prime signature
arXiv:1704.07979 [math.NT] (Published 2017-04-26)
Unexpected biases in prime factorizations and Liouville functions for arithmetic progressions
arXiv:1508.06185 [math.NT] (Published 2015-08-24)
Represent a natural number as the sum of palindromes in various bases