Generalizations of the ErdH{o}s-Kac Theorem and the Prime Number Theorem
classification
🧮 math.NT
math.DS
keywords
primetheoremfactorsintegersnumbergeneralizationslargests-kac
read the original abstract
In this paper, we study the linear independence between the distribution of the number of prime factors of integers and that of the largest prime factors of integers. Respectively, under a restriction on the largest prime factors of integers, we will refine the Erd\H{o}s-Kac Theorem and Loyd's recent result on Bergelson and Richter's dynamical generalizations of the Prime Number Theorem. At the end, we will show that the analogue of these results holds with respect to the Erd\H{o}s-Pomerance Theorem as well.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.