A Theorem on the Function Ω(n) and Mersenne Numbers
We prove that for every positive integer n, the number of prime factors of 2ⁿ−1 (counted with multiplicity) is greater than or equal to the number of prime factors of n. The proof is based on an original form of induction on Ω(n), the total number of prime divisors of n. 📄 Full text available at DOI: https://doi.org/10.5281/zenodo.16447827
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2025-07-25
- DOI
- https://doi.org/10.5281/zenodo.16447826
- Primary Topic
- Analytic Number Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00