Euclid–Euler Theorem and the Largest Known Mersenne Prime: 2^136,279,841 − 1 with 41,024,320 digits — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Euclid–Euler theorem linking even perfect numbers to Mersenne primes, and the discovery of the largest known Mersenne prime \(2^{136\,279\,841}-1\) with 41,024,320 digits. | MATH: \(P = 2^{p-1}(2^{p}-1)\) where \(2^{p}-1\) is prime (Mersenne prime); largest known \(p=136\,279\,841\). | CONNECTION: No direct geometric harmony ratios appear; the structure is purely arithmetic. | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225465433