Divisor Structure of p−1 Modulates Mersenne Prime Exponent Bias — E8 Intelligence Research

FINDING: Mersenne prime exponents p may exhibit secondary arithmetic bias tied to the divisor structure of p−1, modulating the classical Wagstaff probability scale. | MATH: Euclid–Euler theorem: N = 2^(p−1)(2^p − 1) is perfect iff 2^p − 1 is prime (p prime). Wagstaff heuristic: P(M_p prime) ≈ (e^γ / ln 2) · (1/p) · ln(p·ln 2), with e^γ ≈ 1.7811. Candidate refinement: probability depends on τ(p−1), σ(p−1), or factorization of p−1. | CONNECTION: No direct link to 0.618/1.618 ratios in the cited evidence. Structural resonance only: Mersenne exponents p are themselves prime, so p−1 is always even and divisible by 2 — a forced binary structure. Triangular-number link: every even perfect number N = 2^(p−1)(2^p−1) is also the p-th triangular number T_p = p(p+1)/2 only when p=2 (N=6); general perfect numbers are hexagonal numbers H_n = n(2n−1) with n = 2^(p−1). This is the only clean geometric-harmony connection supported. | DEPTH: 6 --- **Detailed extraction:** **1. Key mathematical insigh Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-30
DOI
https://doi.org/10.5281/zenodo.23796611
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Divisor Structure of p−1 Modulates Mersenne Prime Exponent Bias — E8 Intelligence Research

Andrew Stewart Caldin
7 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Divisor Structure of p−1 Modulates Mersenne Prime Exponent Bias — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: Mersenne prime exponents p may exhibit secondary arithmetic bias tied to the divisor structure of p−1, modulating the classical Wagstaff probability scale. | MATH: Euclid–Euler theorem: N = 2^(p−1)(2^p − 1) is perfect iff 2^p − 1 is prime (p prime). Wagstaff heuristic: P(M_p prime) ≈ (e^γ / ln 2) · (1/p) · ln(p·ln 2), with e^γ ≈ 1.7811. Candidate refinement: probability depends on τ(p−1), σ(p−1), or factorization of p−1. | CONNECTION: No direct link to 0.618/1.618 ratios in the cited evidence. Structural resonance only: Mersenne exponents p are themselves prime, so p−1 is always even and divisible by 2 — a forced binary structure. Triangular-number link: every even perfect number N = 2^(p−1)(2^p−1) is also the p-th triangular number T_p = p(p+1)/2 only when p=2 (N=6); general perfect numbers are hexagonal numbers H_n = n(2n−1) with n = 2^(p−1). This is the only clean geometric-harmony connection supported. | DEPTH: 6 --- **Detailed extraction:** **1. Key mathematical insigh Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Divisor Structure of p−1 Modulates Mersenne Prime Exponent Bias — E8 Intelligence Research — Andrew Stewart Caldin · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS