This calculator implements the rigorous framework for computing π and ζ(2n) using Euler product decompositions.
Key Identity: For ℜ(s) > 1, the Riemann zeta function has the Euler product:
Prime-Gap Decomposition: We reorganize Euler's product by prime gaps:
Each prime p belongs to gap class g = (next prime) - p. We group primes by their forward gap.
Basel & π Reconstruction: Since ζ(2) = π²/6:
Validation: Using primes up to 30M → π ≈ 3.14159265358979 (14+ decimals exact)
Phase Law Extension (Critical Strip):
Example: At t=14.1347, p=11: φ = 14.1347×log(11)-π/2 ≈ 32.12 rad
Aligns prime oscillations with first Riemann zero.
Significance:
Two Decomposition Methods:
Error Control: For target error ε, include primes up to:
The Zeta Function as a Phasor Sum:
For complex argument s = σ + it, the Riemann zeta function can be written as:
Each term n-s is a rotating phasor on the complex plane with:
Modular Unity Correspondence:
Each residue class k (mod m) corresponds to an m-th root of unity:
This isomorphism connects modular arithmetic to the unit circle geometry. For each modulus m and residue k:
The Critical Line (σ = 1/2):
On the critical line, each contribution rotates at angular velocity ∝ log n. When modular rotations align destructively, their vector sum vanishes—precisely the condition for a nontrivial zero:
Nested Modular Surface:
Stacking concentric rings for m = 1, 2, 3, ... creates a nested modular unity lattice. Each ring samples the unit circle at m equally-spaced points, and together they approximate the continuous analytic structure of ζ(s). The GCD=1 residues (primitive rotations) form the multiplicative group of units mod m.
Geometric Interpretation:
💡 Key Insight: The nested modular lattice forms a discrete analogue of the complex-analytic domain of ζ(s). By weighting each ring by n-σ and rotating by phase -t log n, we obtain a direct geometric mimic of the Riemann zeta surface.
Theorem (Getachew Prime Channel Avoidance Theorem)
Let each modulus M ∈ ℤ⁺ define a fractional residue system:
Define a reduction channel as the equivalence class of fractions that share the same lowest-term representation:
Each equivalence class corresponds to a fundamental Farey channel of the form 1/N or its rational multiples.
Statement: For every prime modulus p, the complete residue set
contains no reducible fractions, and therefore intersects no reduction channel 1/N for any N > 1.
Interpretation:
Primes define irreducible modular orbits within the fractional lattice. Their residues never project downward into simpler rational channels because no shared divisors exist between any residue r and the prime modulus p. Each prime ring therefore forms a fully independent coprime manifold, geometrically isolated from the composite Farey flows that pass through reducible fractions such as 1/2, 1/3, 1/4, ...
Geometric Consequence:
In the nested modular plane, the loci of reducible fractions form continuous Farey flow lines — rational channels through which composite moduli project. Prime moduli, in contrast, occupy the interstitial lattice regions between these channels, creating smooth, full, and non-overlapping modular rings.
⟹ Prime moduli trace paths that avoid all reducible channels, forming the pure coprime skeleton of the modular continuum.
Corollary (Getachew Composite Channel Projection Corollary)
Let M ∈ ℤ⁺ be a composite modulus. For each integer r (0 ≤ r < M) define the fraction r/M.
Write d = gcd(r, M) and set r' = r/d, M' = M/d.
Then r/M reduces to the lowest-term fraction r'/M' with gcd(r', M') = 1.
Statement: Every composite modulus M admits a nontrivial projection of its residues onto reduction channels (Farey channels):
Key Properties:
Example: M = 12
φ(12) = 4, so M - φ(M) = 8 reducible residues
Proper divisors M' ∈ {1, 2, 3, 4, 6}
Take r = 8: gcd(8,12) = 4, r' = 2, M' = 3
Thus 8/12 = 2/3, projecting onto the 1/3-family (channel with denominator 3)
There are d = 4 residues that reduce to each fraction with denominator 3
Geometric Consequence:
In the nested modular plane, reducible residues of composite moduli populate the Farey flow lines (the 1/N channels and their rational multiples). Each channel with denominator M' < M collects exactly d = M/M' lattice points from modulus M for each corresponding coprime numerator r'.
⟹ Composite moduli project their reducible residues onto a dense web of Farey channels; primes, by contrast, contribute only irreducible residues and avoid these channels.
Use the "Prime & Composite Channels" visualization to see both theorems in action:
Together, these theorems reveal the fundamental geometric distinction between primes and composites in the modular lattice.
Definition: For each prime p, define the semiprime set:
Theorem (Getachew Semiprime Generation):
Asymptotic Density:
Semiprimes are denser than primes (which have density ~ x/log x).
RSA Connection:
Modular Properties:
For modulus m:
This creates "modular interference patterns" - semiprimes populate residue classes differently than primes.
Semiprime Zeta Function:
This function interpolates between the prime zeta function and contributions to the Riemann zeta function.
Creator & Original Research: Wessen Getachew (@7Dview)
Original Contributions by Wessen Getachew:
Classical Mathematical Foundations:
Educational Inspiration:
Key References:
Online Resources:
Technologies Used:
Note: This calculator combines classical analytic number theory with original research by Wessen Getachew on modular decompositions of the Riemann zeta function. The visualizations and interactive tools are designed to make these deep mathematical concepts accessible to students, educators, and researchers. All novel theorems and methods are original contributions that build upon the classical foundations of Euler, Riemann, and Dirichlet.
Citation: If you use this calculator or reference the original research in academic work, please cite:
Getachew, W. (2025). "Modular Sieve: Computing π and ζ(2n) via Gap-Class and Residue-Channel Decompositions". Interactive Mathematical Calculator. Available at: [URL]