Generalizations of the Erdős-Kac Theorem and the Prime Number Theorem

2023/03/10 by Biao Wang, Wang, Biao, Zhining Wei +5
Mathematics · Physics and Astronomy · #Analytic Number Theory Research #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT) #Quantum Mechanics and Applications

paper · pdf · doi:10.48550/arxiv.2303.05803

openalex publication_date 2023/03/10 · openalex created_date 2023/03/14 · openalex updated_date 2026/07/28

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ő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ős-Pomerance Theorem as well.

Related

• An information-theoretic proof of the Erdős-Kac theorem
• Generalizations of Erdős-Kac theorem with applications
• An Erdős-Kac theorem for integers with dense divisors
• A subset generalization of the Erdős-Kac theorem over number fields with applications
• An analogue of the Erdős-Kac theorem for the special linear group over the integers