English

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

Number Theory 2020-12-15 v1

Abstract

Let f(n)f(n) be the number of distinct exponents in the prime factorization of the natural number nn. We prove some results about the distribution of f(n)f(n). In particular, for any positive integer kk, we obtain that #{nx:f(n)=k}Akx \#\{n \leq x : f(n) = k\} \sim A_k x and #{nx:f(n)=ω(n)k}Bx(loglogx)kk!logx, \#\{n \leq x : f(n) = \omega(n) - k\} \sim \frac{B x (\log \log x)^k}{k! \log x} , as x+x \to +\infty, where ω(n)\omega(n) is the number of prime factors of nn and Ak,B>0A_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.

Keywords

Cite

@article{arxiv.1902.09224,
  title  = {On the number of distinct exponents in the prime factorization of an integer},
  author = {Carlo Sanna},
  journal= {arXiv preprint arXiv:1902.09224},
  year   = {2020}
}