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

Biao Wang , Zhining Wei , Pan Yan , Shaoyun Yi

Communications in Mathematics and Statistics ›› 2025, Vol. 13 ›› Issue (5) : 1177 -1197.

PDF
Communications in Mathematics and Statistics ›› 2025, Vol. 13 ›› Issue (5) : 1177 -1197. DOI: 10.1007/s40304-023-00354-6
Article
research-article

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

Author information +
History +
PDF

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. 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, respectively. At the end, we will show that the analogue of these results holds with respect to the Erdős–Pomerance Theorem as well.

Keywords

Erdős–Kac Theorem / Erdős–Pomerance Theorem / Largest prime factor / Prime Number Theorem / 11K36 / 37A44

Cite this article

Download citation ▾
Biao Wang, Zhining Wei, Pan Yan, Shaoyun Yi. Generalizations of the Erdős–Kac Theorem and the Prime Number Theorem. Communications in Mathematics and Statistics, 2025, 13(5): 1177-1197 DOI:10.1007/s40304-023-00354-6

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

China Postdoctoral Science Foundation(2021TQ0350)

RIGHTS & PERMISSIONS

School of Mathematical Sciences, University of Science and Technology of China and Springer-Verlag GmbH Germany, part of Springer Nature

AI Summary AI Mindmap
PDF

107

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/