Algebraic Transformation of the Prime Number Theorem and Legendre's Formula for the Modular Sequence N = 2 * 3^n * 4 * 5
English: This study investigates the prime-counting function π(N) and prime density π(N)/N along theexponential sequence N(n) = 2 · 3n · 4 · 5 = 40 · 3n, constructed from a base-12 modular clock frameworkand wheel factorization principles. By substituting N = 40 · 3n into Adrien-Marie Legendre's asymptoticprime-counting formula π(N) ≈ N / (ln(N) - 1), we derive the algebraic form (40 · 3n) / (n · ln(3) + ln(40) -1). Remarkably, for the initial steps n = 1, 2, 3 (N = 120, 360, 1080), this logarithmic expression alignsexactly with the integer rational formula π(N) = N / (n + 3), yielding 30, 72, and 180 primes with zero error(and exact unit-fraction prime densities 1/4, 1/5, and 1/6). For n ≥ 4, the linear integer calibration divergesdue to the cumulative slope difference between ln(3) ≈ 1.0986 and 1, whereas the Legendretransformation and its higher-order asymptotic expansion N / (L - 1 - 1/L - 3/L2) maintain over 99.99%accuracy even at astronomical scales such as n = 26.
Authors
- Samet Sahin
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-15
- DOI
- https://doi.org/10.5281/zenodo.24254263
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint