On the sizes of the maximal prime powers divisors of factorials
Communications in Mathematics · 07.07.2026 · Volume 34 (2026), Issue 1
DOI: 10.46298/cm.17290 ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications in Mathematics, online erschienen am 07.07.2026. Verfasst von Dan Levy.
Abstract (Originalsprache)
Let p be any prime, and $p^(ν_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(ν_q(n!)) < p^(ν_p(n!))$ for all $n \ge n_0$ and all primes $q > p$. For twin primes $p$ and $q = p + 2$ it is proved that the minimal $n_0$ satisfying $q^(ν_q(n!)) < p^(ν_p(n!))$ for all $n \ge n_0$ is given by $n_0 = (p^2+p)/2$.
Zitieren
APA
Levy, D. (2026). On the sizes of the maximal prime powers divisors of factorials. Communications in Mathematics, Volume 34 (2026), Issue 1. https://doi.org/10.46298/cm.17290
Vancouver
Levy D. On the sizes of the maximal prime powers divisors of factorials. Communications in Mathematics. 2026;Volume 34 (2026), Issue 1. doi:10.46298/cm.17290
BibTeX
@article{Levy2026,
author = {Levy, Dan},
title = {On the sizes of the maximal prime powers divisors of factorials},
journal = {Communications in Mathematics},
year = {2026},
volume = {Volume 34 (2026), Issue 1},
doi = {10.46298/cm.17290}
}
EUVIMED