A Theorem on the Function Ω(n) and Mersenne Numbers
Year: 2025
Type: article
Abstract: 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
Author: Fierro, Giuseppe
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6930891331
FWCI:
Cites:
Cited by:
Related to: