The problem of counting primitive lattice points (points with gcd = 1) in a scaled convex body is fundamental in analytic number theory. This platform presents the Geometric Möbius Shell Sieve—a dimension-universal approach that reveals the sieve mechanism geometrically through multi-scale decomposition.
For n ≥ 3 and K a bounded convex body with piecewise C¹ boundary:
The core identity uses inclusion-exclusion via the Möbius function:
This remarkable identity follows from the Dirichlet series: Σ μ(k)/k^n = 1/ζ(n).
The error arises entirely from lattice points clustered near boundaries. As dimension increases, error becomes negligible for large R.
Examples: μ(2) = -1, μ(3) = -1, μ(4) = 0, μ(6) = 1, μ(30) = -1
41 interactive visualization tools spanning 300 years of number theory
| Tab | Primary Formula | Key Result |
|---|---|---|
| 2D Lattice | N(R) = (6/π²)πR² + O(R) | 60.79271019% primitive |
| 3D Ball | N(R) = (4π/3ζ(3))R³ + O(R²) | 83.19073726% primitive |
| Möbius | μ(n) = (-1)^k if squarefree, else 0 | Σμ(d) = [n=1] |
| Farey | |F_n| = 1 + Σ_{k=1}^n φ(k) | ~3n²/π² fractions |
| Primitive Roots | ord_p(g) = p-1 ⟺ g primitive | φ(p-1) generators |
| Circle Problem | N(R) = πR² + O(R^θ) | θ ≤ 131/208 ≈ 0.63 |
| Dirichlet | L(s,χ) = Σ χ(n)n⁻ˢ | L(1,χ) ≠ 0 for χ≠χ₀ |
| Twin Primes | B₂ = Σ(1/p + 1/(p+2)) | B₂ ≈ 1.902160583 |
| π(x) | π(x) = Li(x) + O(x·e^(-c√ln x)) | RH ⟹ O(√x ln x) |
| k-Free | Q_k(N) = N/ζ(k) + O(N^(1/k)) | k=2: ~60.79% sqfree |
| Euler Product | π = √(6·∏_p(1-p⁻²)⁻¹) | Compute π from primes |
| Chord CV | CV = σ_L/μ_L for chord lengths | Primes: CV→0, Comp: CV≈0.30 |
| n | ζ(n) | 1/ζ(n) | Closed Form | Interpretation |
|---|---|---|---|---|
| 2 | 1.6449340668 | 0.6079271019 | π²/6 | 60.79271019% pairs coprime |
| 3 | 1.2020569032 | 0.8319073726 | Apéry's constant | 83.19073726% triples coprime |
| 4 | 1.0823232337 | 0.9239393751 | π⁴/90 | 92.39393751% 4-tuples coprime |
| 5 | 1.0369277551 | 0.9643969402 | — | 96.43969402% 5-tuples coprime |
| 6 | 1.0173430620 | 0.9829525700 | π⁶/945 | 98.29525700% 6-tuples coprime |
| 8 | 1.0040773562 | 0.9959389757 | π⁸/9450 | 99.59389757% 8-tuples coprime |
In three dimensions, primitive lattice point density approaches 1/ζ(3) ≈ 0.832, where ζ(3) is Apéry's constant (proved irrational in 1978). The 3D visualization shows points (x,y,z) with gcd(x,y,z)=1 inside a ball. Drag to rotate. Higher dimensions follow the pattern 1/ζ(k) for k-dimensional balls.
Controls: Left-drag to rotate | Scroll to zoom | Right-drag to pan | Inverted flips inner↔outer
The Möbius function μ(n) equals (-1)^k if n is squarefree with k prime factors, and 0 otherwise. It's the multiplicative inverse of the constant function under Dirichlet convolution. The Mertens function M(x) = Σμ(n) for n≤x satisfies |M(x)| = O(x^{1/2+ε}) iff RH is true. μ(n) powers inclusion-exclusion counting.
μ(n) = (-1)^k if n = p₁p₂...pₖ (k distinct primes), 0 if n has squared factor. Core identity: Σ_{d|n} μ(d) = [n=1]
| n | μ(n) | M(n) | Factorization | Squarefree |
|---|
The Cayley transform w = i(1+z)/(1-z) maps the unit disk to the upper half-plane, and its inverse maps ℍ → 𝔻. This conformal map is fundamental to hyperbolic geometry and automorphic forms. Ford circles tangent to ℝ at rationals transform to horocycles.
w = i(1+z)/(1-z) maps unit disk to ℍ. PSL(2,ℤ) acts by Möbius transformations. Geodesics are semicircles ⊥ to ℝ.
A primitive root mod n is a generator of the multiplicative group (ℤ/nℤ)×. Exists iff n ∈ {1,2,4,p^k,2p^k} for odd prime p. The discrete logarithm problem — finding k where g^k ≡ a — is computationally hard, forming the basis of Diffie-Hellman cryptography.
g is a primitive root ⟺ ord(g) = φ(M) ⟺ ⟨g⟩ = (ℤ/Mℤ)×
| k | ord(k) | Unit? | Prim Root? | QR? | Disc Log |
|---|
The Farey sequence F_n contains all reduced fractions p/q with 0 ≤ p/q ≤ 1 and q ≤ n, in order. Adjacent fractions a/b, c/d satisfy |ad-bc|=1 (mediant property). |F_n| ~ 3n²/π². Farey sequences connect to Ford circles, continued fractions, and the Riemann Hypothesis.
F_Q = {p/q : 0≤p≤q≤Q, gcd(p,q)=1} ordered by value. Neighbors satisfy |ps-qr|=1.
| Index | p/q | Value | Level | Left Neighbor | Right Neighbor |
|---|
Integers arranged on concentric rings by residue class mod M reveal prime distribution patterns. Primes avoid certain residue classes (those sharing factors with M). The φ(M) coprime residue classes form the multiplicative group (ℤ/Mℤ)×. Multi-modulus view shows nested structure; single-M view projects onto Farey channels.
Concentric rings show residue classes. Gold points have GCD(r,M)=1 (Dirichlet character support χ(r)≠0). Direct lifts connect same residue across moduli.
A geometric visualization framework for modular arithmetic that places residues r ∈ {0,1,...,M-1} at angles θ = 2πr/M on concentric circles. The radial coordinate encodes the modulus M, creating a "lifting tower" where vertical connections between rings reveal how residues reduce or lift across moduli. Gold points mark coprime residues (the multiplicative group (ℤ/Mℤ)×), while gray points mark reducible residues. This visualization unifies Dirichlet characters, primitive roots, and the Chinese Remainder Theorem in a single geometric framework.
The "gap connections" between consecutive coprime residues within each ring reveal prime structure: primes p have φ(p) = p-1 evenly distributed coprimes with gap=1, while highly composite M shows clustering around coprime channels. The Smith Chart overlay applies the Cayley transform Γ=(z-1)/(z+1) to map the modular rings into the hyperbolic plane, connecting modular arithmetic to RF engineering impedance matching.
The error E(R) = V(R) - 6R²/π² between actual primitive count and predicted shows systematic patterns. The Riemann Hypothesis implies |E(R)| = O(R^{1/2+ε}) for any ε > 0. Analyzing normalized error E(R)/R reveals oscillations connected to zeta zeros. This tab provides multiple views of the error term behavior.
| R | Theory | Actual | Primitive | Error | |Error|/√R | Rel % |
|---|
The primitive density in k-dimensional balls approaches 1/ζ(k). For k=2: 6/π² ≈ 0.608. For k=3: 1/ζ(3) ≈ 0.832. As k→∞, density→1. This tab compares densities across dimensions and verifies the theoretical predictions with actual counts.
| n | Vol(Bⁿ) | ζ(n) | 1/ζ(n) | Computed | Error | Method |
|---|
Every lattice point belongs to exactly one "shell" defined by its GCD value g. The g=1 shell contains primitive points. Higher shells (g=2,3,...) contribute to total count via Möbius inversion. Shell counts satisfy Σ_{d|g} shell(d) = total(g). This decomposition underlies the 1/ζ(k) formula.
Primitive count P(R) = Σ μ(k)·L(R/k) where L counts all lattice points
| k | μ(k) | L(R/k) | Contribution | Cumulative | % of Total | Squarefree? |
|---|
A geometric visualization of the classical Möbius inversion formula for counting primitive lattice points. The sieve decomposes the count P(R) into contributions from "shells" at scale k: each shell S_k contains points (kx, ky, ...) where gcd(x,y,...) = 1. The Möbius function μ(k) provides the inclusion-exclusion weights, with positive shells (μ=+1) adding points and negative shells (μ=-1) removing overcounts. The visualization shows how these shells geometrically nest and cancel to isolate exactly the primitive points.
The sum truncates naturally at k = R (since L(R/k) = 0 for k > R), and only squarefree k contribute (since μ(k) = 0 otherwise). The dominant contribution comes from k=1 (all lattice points), with corrections from small prime scales k=2,3,5,... The cumulative sum converges to P(R) = Vol(K)·R^n/ζ(n) + O(R^{n-1}).
The GCD of random pairs follows a remarkable distribution: P(gcd=g) = 1/(g²ζ(2)) = 6/(π²g²). Mean GCD ≈ 1.645 (= ζ(2)). The proportion with gcd=1 is 6/π² ≈ 60.8%. This tab analyzes GCD statistics across lattice regions.
| GCD | Count | Percent | Cumulative | Theory | Squarefree? | Factorization |
|---|
Gaussian integers a+bi form a lattice in ℂ with unique factorization. Gaussian primes are primes p≡3(mod 4), or π where ππ̄=p for p≡1(mod 4), or 1+i (above 2). The norm N(z)=|z|²=a²+b² is multiplicative. Units are {±1, ±i}.
The Gauss circle problem asks: how many lattice points lie inside a circle of radius R? The answer N(R) = πR² + E(R) where |E(R)| = O(R^θ). The best known θ ≈ 131/208 ≈ 0.63. Conjectured θ = 1/2 + ε. Connected to the Riemann Hypothesis through divisor sums.
Lattice points inside circle of radius R. Count ≈ πR² with error O(R^θ).
| R | N(R) | πR² | r(R) | r(R)/√R | |r(R)|/R^0.5 |
|---|
This tab empirically verifies that primitive lattice point density converges to 1/ζ(k). Compare actual ratios V(R)/|B_R| against theoretical 1/ζ(k) values as R increases. The convergence rate depends on the error term behavior.
| k | ζ(k) | 1/ζ(k) | Empirical | Total | Primitive | Abs Err | Rel Err % |
|---|
Dirichlet characters χ mod q are completely multiplicative functions with χ(n+q)=χ(n). They form an orthogonal basis for functions on (ℤ/qℤ)×. The L-function L(s,χ) = Σχ(n)/n^s generalizes ζ(s). Dirichlet proved infinitely many primes in arithmetic progressions using these.
χ(r) ≠ 0 (gold) when gcd(r,M)=1. χ(r) = 0 (gray) when gcd(r,M) > 1. Characters map units to roots of unity.
| r | gcd(r,M) | χ(r) | |χ(r)| | arg(χ(r)) | Support? |
|---|
Twin primes are pairs (p, p+2) both prime: (3,5), (5,7), (11,13), (17,19)... The twin prime conjecture (unproven) states infinitely many exist. Brun proved Σ1/p over twin primes converges (B₂ ≈ 1.902). Zhang (2013) proved bounded gaps; current bound is 246.
Twin primes (p, p+2) become rarer but are conjectured infinite. Brun proved Σ1/p (twin) converges.
| p | p+g | Gap | log(p) | gap/log(p) | Σ1/p |
|---|
π(x) counts primes ≤ x. The Prime Number Theorem: π(x) ~ x/ln(x) ~ Li(x). Gauss conjectured, Hadamard/de la Vallée Poussin proved (1896). The error π(x) - Li(x) oscillates, with RH implying |error| = O(√x log x). First crossover where π(x) > Li(x) is near 10^316.
π(x) counts primes ≤ x. PNT: π(x) ~ x/ln(x). Li(x) is the best elementary approximation.
| x | π(x) | x/ln(x) | Li(x) | Error Li | Rel % |
|---|
Composite moduli create "channels" of residue classes with multiplicative structure. For M = p₁p₂...pₖ, the Chinese Remainder Theorem decomposes (ℤ/Mℤ)× ≅ ∏(ℤ/pᵢℤ)×. This tab visualizes how composites distribute across residue channels.
Cyan = coprime (gcd=1), Red = reducible (gcd>1). Lines show projection r/M → r'/M' where M'=M/gcd(r,M).
| r | gcd(r,M) | Channel M' | Reduced r' | Type | Multiplicity |
|---|
A framework for understanding how residues modulo composite M decompose into "channels" indexed by divisors of M. Each residue r ∈ {0,1,...,M-1} projects to a reduced channel M' = M/gcd(r,M) with reduced residue r' = r/gcd(r,M). This creates a hierarchical lattice structure where the divisor lattice τ(M) organizes all possible reduction paths. Coprime residues (gcd=1) stay in the "full" channel M, while reducible residues collapse to smaller channels with multiplicities given by divisor counts.
The projection r → r' reveals the multiplicative structure hidden in modular arithmetic. For highly composite M (like primorials 6, 30, 210, 2310), the channel decomposition provides a "sieve" perspective: primes beyond the prime factors of M survive in the coprime channel, while composite numbers collapse into reducible channels. This connects directly to wheel factorization and the Möbius sieve structure.
V(R) counts coprime pairs (a,b) with a²+b² ≤ R². Asymptotically V(R) ~ 6R²/π². The error E(R) = V(R) - 6R²/π² is the primary object connecting lattice counting to RH. The conjecture |E(R)| = O(R^{1/2+ε}) is equivalent to RH for related zeta functions.
Primitive vectors (gcd=1) are visible from origin. V(R)/πR² → 6/π² connects to Riemann Hypothesis.
| a | b | gcd | Norm | θ° | Coprime? |
|---|
An interactive exploration of the deep connection between coprime lattice point counting and the Riemann Hypothesis. The function V(R) = #{(a,b) : gcd(a,b)=1, a²+b²≤R²} grows asymptotically as 6R²/π² = R²/ζ(2). The error term E(R) = V(R) - 6R²/π² encodes information about the zeta function zeros. The Riemann Hypothesis is equivalent to the bound |E(R)| = O(R^{½+ε}) for all ε > 0, analogous to the Gauss circle problem but for coprime pairs.
The visualization tracks |E(R)|/R^½ as a function of R. If RH is true, this ratio should remain bounded. The normalized error connects directly to the Mertens function M(N) = Σμ(n), and the bound |M(N)|/√N < const would prove RH. Current computations suggest the ratio fluctuates but does not diverge—consistent with RH but not a proof.
Sierpiński (1964) asked which positive integers cannot be expressed as 6ab ± a ± b for positive a,b. There are 78 such "uncovered" integers ≤ 1000. The complete characterization remains open. This connects to representations by binary quadratic forms.
Green = expressible as 6ab±a±b. Red = uncovered (Sierpiński candidates). Status: UNSOLVED since 1964.
| n | n mod 6 | n mod 12 | Factorization | Neighbors |
|---|
A k-free integer has no prime factor with multiplicity ≥ k. Squarefree = 2-free. The density of k-free integers is 1/ζ(k). For k=2: 6/π² ≈ 60.8% are squarefree. The error term follows |error| = O(N^{1/k}). Möbius function μ(n) indicates 2-free status.
n is k-free if no prime p has p^k | n. Count Q_k(N) ~ N/ζ(k) with error O(N^(1/k)).
| n | Factorization | Divisible by p^k | Smallest p |
|---|
Euler's product formula ζ(s) = ∏_p(1-p^{-s})^{-1} connects the zeta function to primes. Taking partial products gives approximations to π and ζ(2n). Each prime contributes a factor. The formula encodes the Fundamental Theorem of Arithmetic.
Computing π using primes ≤ 1000. Basel: ζ(2)=π²/6.
The Chord Coefficient of Variation (CV) measures uniformity of chord lengths between n-th roots of unity. Primes show lower CV (more uniform) than composites. This heuristic achieves ~92% prime/composite separation for n ≤ 10000. Based on Getachew (2025) framework.
Primes have uniform coprime spacing (low CV). Composites have irregular gaps (high CV). Separation grows with n.
| n | Type | φ(n) | CV | Gap Ratio | Verdict |
|---|
A novel primality heuristic based on the geometric uniformity of coprime residue distributions on the unit circle. For any integer n, we place the φ(n) coprime residues r ∈ (ℤ/nℤ)× at angles θ_r = 2πr/n on the unit circle. The chord lengths between consecutive coprimes reveal a striking dichotomy: primes exhibit uniform spacing (low coefficient of variation), while composites show irregular gaps due to their divisor structure. This heuristic achieves ~92% classification accuracy for n ≤ 10,000 using a simple threshold CV < 0.22.
For prime p, the coprime set is {1,2,...,p-1}, which distributes uniformly around the circle. The gaps between consecutive coprimes are all 1, yielding identical chord lengths L = 2·sin(π/p). As p → ∞, CV → 0 geometrically. For composite n = p₁^a₁·p₂^a₂·..., gaps cluster around multiples of the prime factors, creating variance in chord lengths and higher CV values.
Goldbach's conjecture (1742): every even integer ≥ 4 is the sum of two primes. Verified to 4×10^18. The partition count G(n) = #{(p,q): p+q=n, p≤q prime} grows roughly like n/(ln n)². The "Goldbach comet" plots G(n) vs n. Hardy-Littlewood gave a conjectural asymptotic.
Prime gaps g_n = p_{n+1} - p_n vary irregularly. Average gap ~ ln(p_n). Cramér conjectured max gap = O((ln p)²). Record gaps grow slowly. The ratio g_n/ln(p_n) has mean 1 but large fluctuations. Zhang (2013) proved lim inf g_n < 70 million; now < 246.
Sophie Germain primes p have 2p+1 also prime (called safe prime). Examples: 2, 3, 5, 11, 23, 29, 41, 53, 83, 89... Used in cryptography (strong primes). Cunningham chains: sequences where each term generates the next. Conjecture: infinitely many Sophie Germain primes.
M(x) = Σ_{n≤x} μ(n) tracks the cumulative Möbius function. The Mertens conjecture |M(x)| < √x was disproved (Odlyzko-te Riele, 1985), but RH ⟺ M(x) = O(x^{1/2+ε}). The ratio M(x)/√x oscillates, with proven bounds |M(x)| < x for all x.
Click any point for details. RH ⟺ M(x) = O(x^{1/2+ε}) for all ε>0.
The Mertens function M(x) = Σ_{n≤x} μ(n) is the summatory function of the Möbius function. It encodes the "imbalance" between squarefree integers with even vs odd numbers of prime factors. The Riemann Hypothesis is equivalent to the bound |M(x)| = O(x^{1/2+ε}) for all ε > 0. The weaker Mertens conjecture |M(x)| < √x was disproved by Odlyzko and te Riele (1985), but the RH bound remains open.
The connection to RH comes through the identity: 1/ζ(s) = Σμ(n)/n^s. The Dirichlet series for 1/ζ(s) converges absolutely for Re(s) > 1. The behavior of M(x) determines how far left this can be analytically continued. If |M(x)| = O(x^{1/2+ε}), then ζ(s) has no zeros with Re(s) > 1/2, which is RH. The normalized ratio M(x)/√x oscillates but should remain bounded if RH is true.
ψ(x) = Σ_{p^k≤x} log p and θ(x) = Σ_{p≤x} log p. The PNT states ψ(x) ~ x. RH implies ψ(x) = x + O(√x log²x). Chebyshev proved 0.92 < ψ(x)/x < 1.11 without PNT. The explicit formula ψ(x) = x - Σ_ρ x^ρ/ρ - log(2π) connects to zeta zeros.
ψ(x) counts prime powers weighted by log. PNT: ψ(x) ~ x. RH: ψ(x) = x + O(x^{1/2+ε}).
The Chebyshev function ψ(x) = Σ_{n≤x} Λ(n) where Λ(n) is the von Mangoldt function (log p if n=p^k, else 0). The companion function θ(x) = Σ_{p≤x} log p sums only over primes. The Prime Number Theorem (PNT) states ψ(x) ~ x and θ(x) ~ x as x→∞. These functions are smoother than π(x) and connect directly to ζ(s) zeros.
The explicit formula connects ψ(x) to zeta zeros: ψ(x) = x - Σ_ρ x^ρ/ρ - log(2π) - ½log(1-x^{-2}), where the sum is over nontrivial zeros ρ of ζ(s). Each zero contributes an oscillation. RH (all ρ have Re(ρ)=1/2) implies these oscillations decay like √x, giving ψ(x) = x + O(√x log²x).
Li(x) = ∫₂ˣ dt/ln(t) is the best simple approximation to π(x). The PNT states π(x) ~ Li(x). Littlewood proved π(x) - Li(x) changes sign infinitely often. First sign change (Skewes number) is near 10^316. Under RH: |π(x) - Li(x)| = O(√x log x).
Li(x) is the best elementary approximation to π(x). Click points for details.
The logarithmic integral Li(x) = ∫₂ˣ dt/ln(t) provides the best elementary approximation to the prime counting function π(x). Gauss conjectured π(x) ~ Li(x), which is the Prime Number Theorem (proved 1896). While x/ln(x) is simpler, Li(x) has smaller error: |π(x) - Li(x)| grows much slower than |π(x) - x/ln(x)|.
Surprisingly, Li(x) > π(x) for all computed values, but Littlewood proved π(x) - Li(x) changes sign infinitely often! The first crossover (Skewes number) is enormous: around 10^316. Under RH, |π(x) - Li(x)| = O(√x log x). Riemann's function R(x) = Σ μ(n)/n · Li(x^{1/n}) is even more accurate, incorporating the zeros of ζ(s).
τ(n) = d(n) counts divisors; σ(n) sums them. Both are multiplicative. Average d(n) ~ log n. Highly composite numbers maximize d(n). Perfect numbers satisfy σ(n) = 2n. Robin's inequality: σ(n) < e^γ n log log n for n > 5040 ⟺ RH.
τ(n) counts divisors, σ(n) sums them. Click points for factorization details.
The divisor function τ(n) = d(n) counts the number of positive divisors of n, while σ(n) sums all divisors. For prime p, τ(p)=2 and σ(p)=p+1. These are multiplicative: τ(mn)=τ(m)τ(n) when gcd(m,n)=1. The average value of τ(n) is log n + 2γ - 1 where γ≈0.5772 is Euler's constant. Highly composite numbers have more divisors than any smaller number.
The abundancy index σ(n)/n classifies numbers: deficient (σ(n)/n < 2), perfect (σ(n)/n = 2), or abundant (σ(n)/n > 2). Perfect numbers satisfy σ(n) = 2n (e.g., 6, 28, 496). Euler proved even perfect numbers have form 2^{p-1}(2^p - 1) where 2^p - 1 is Mersenne prime. Whether odd perfect numbers exist is unknown!
λ(n) = (-1)^{Ω(n)} where Ω(n) counts prime factors with multiplicity. Completely multiplicative: λ(mn) = λ(m)λ(n). The Pólya conjecture L(x) = Σλ(n) ≤ 0 was disproved; first counterexample near 906 million. RH ⟹ L(x) = O(x^{1/2+ε}).
λ(n) = (-1)^{Ω(n)} where Ω(n) counts prime factors with multiplicity. RH connection via Pólya conjecture.
The Liouville function λ(n) = (-1)^{Ω(n)} where Ω(n) is the number of prime factors of n counted with multiplicity. Unlike μ(n), λ(n) is never zero. The summatory function L(x) = Σ_{n≤x} λ(n) relates to M(x) via: L(x) = Σ_{k≤√x} M(x/k²). The Liouville function is completely multiplicative: λ(mn) = λ(m)λ(n) for all m,n.
Pólya conjectured (1919) that L(x) ≤ 0 for all x ≥ 2, meaning more integers have an odd number of prime factors. This was disproved by Haselgrove (1958)! The first counterexample is around x ≈ 906,150,257. Like M(x), RH implies L(x) = O(x^{1/2+ε}).
Λ(n) = log p if n = p^k for prime p, else 0. It's the "prime indicator with weights." ψ(x) = Σ Λ(n). The explicit formula ψ(x) = x - Σ_ρ x^ρ/ρ - log(2π) - ½log(1-x⁻²) shows how zeros govern prime distribution.
Λ(n) = log p if n = p^k for prime p, else 0. Core building block for Chebyshev functions.
The von Mangoldt function Λ(n) equals log p when n is a prime power p^k, and 0 otherwise. It satisfies the elegant identity: Σ_{d|n} Λ(d) = log n, making it fundamental to multiplicative number theory. The Chebyshev function ψ(x) = Σ_{n≤x} Λ(n) smooths prime counting, and PNT states ψ(x) ~ x.
The explicit formula directly connects Λ(n) to zeta zeros: ψ(x) = x - Σ_ρ x^ρ/ρ - log(2π) + O(1), where ρ runs over nontrivial zeros of ζ(s). Each zero contributes an oscillating term x^ρ/ρ. If RH holds (all Re(ρ) = 1/2), these oscillations have amplitude √x, giving optimal error bounds.
c_q(n) = Σ_{gcd(a,q)=1} e^{2πian/q} is always an integer (remarkable!). They form an orthogonal basis for arithmetic functions. c_q(n) = μ(q/gcd(q,n))φ(q)/φ(q/gcd(q,n)). Used in the circle method and additive number theory.
Sum of primitive q-th roots of unity raised to power n. Always an integer! Click for details.
The Ramanujan sum c_q(n) = Σ_{1≤a≤q, gcd(a,q)=1} e^{2πian/q} is the sum of primitive q-th roots of unity raised to the n-th power. Remarkably, c_q(n) is always an integer! It equals μ(q/gcd(n,q))·φ(q)/φ(q/gcd(n,q)) when gcd(n,q) divides q. Ramanujan sums form an orthogonal basis for arithmetic functions.
Any arithmetic function f(n) with convergent series can be expanded: f(n) = Σ_q a_q·c_q(n). For example, μ(n) = Σ_q μ(q)c_q(n)/φ(q) and d(n) = Σ_q c_q(n)log(q)/q. This is Fourier analysis on the integers! The expansion converges for multiplicative functions.
Stanisław Ulam (1963) arranged integers in a square spiral and noticed primes cluster on diagonals. These correspond to quadratic polynomials like n² + n + 41 (Euler's famous prime-rich polynomial). The visual reveals hidden structure in prime distribution.
Integers spiral outward; primes cluster along diagonals. Discovered by Stanisław Ulam (1963).
The Ulam spiral arranges positive integers in a square spiral, starting from 1 at the center. When primes are highlighted, striking diagonal patterns emerge. Discovered by Stanisław Ulam in 1963 while doodling during a boring meeting! The diagonals correspond to quadratic polynomials n² + n + 41 (Euler's prime-rich polynomial) and similar forms.
Diagonals in the Ulam spiral represent quadratic sequences 4n² + bn + c. Some produce many primes: Euler's n² + n + 41 gives primes for n = 0 to 39. The diagonal density depends on the discriminant b² - 16c. Hardy-Littlewood conjecture predicts asymptotic prime density for each polynomial.
Robert Sacks's spiral places n at polar coordinates (√n, 2π√n). Primes form curved arms corresponding to quadratic residues. Perfect squares lie on the positive x-axis. The visualization reveals parabolic curves of prime-rich quadratics.
Each integer n at angle θ = 2π√n, radius r = √n. Primes form curved arms. Click for details.
The Sacks spiral (Robert Sacks, 1994) places integer n at polar coordinates (√n, 2π√n). Perfect squares lie on the positive x-axis. Primes cluster along curved arms corresponding to quadratic polynomials. Unlike Ulam's square spiral, the Sacks spiral reveals smooth parabolic curves through prime-rich sequences.
Each parabolic arm in the Sacks spiral corresponds to a quadratic polynomial an² + bn + c. Primes from n² + n + 41 form a distinct curve. The visual clustering reveals that primes are not random but follow patterns encoded in quadratic residues modulo small primes. Twin primes appear as nearby paired curves.
Z(t) = e^{iθ(t)}ζ(½+it) is REAL-valued. Its sign changes correspond exactly to zeros of ζ(s) on the critical line. RH states ALL nontrivial zeros are sign changes of Z(t). First zeros at t ≈ 14.135, 21.022, 25.011. Over 10^13 zeros verified on the line.
Z(t) is real! Sign changes = zeros on critical line. RH: ALL nontrivial zeros are sign changes of Z(t).
The Hardy Z-function Z(t) = e^{iθ(t)}ζ(½+it) where θ(t) is the Riemann-Siegel theta function. The key property: Z(t) is REAL for real t! This means zeros of ζ(s) on the critical line Re(s)=½ appear as sign changes of Z(t). Hardy (1914) used this to prove infinitely many zeros lie on the critical line.
The Riemann Hypothesis states that ALL nontrivial zeros of ζ(s) have Re(s)=½. Equivalently: every zero appears as a sign change of Z(t). The first zeros occur at t ≈ 14.135, 21.022, 25.011, 30.425, 32.935... Over 10 trillion zeros verified on critical line!
Gram points g_n satisfy θ(g_n) = nπ. They organize zero counting: "Gram's Law" expects one zero per Gram interval (holds ~73%). Violations (Gram blocks) and Lehmer pairs (close zeros) reveal fine structure. Rosser's rule refines counting.
Gram points organize zero counting. Gram's Law: usually one zero per Gram interval. Violations are rare but important.
Gram points g_n are defined by θ(g_n) = nπ where θ(t) is the Riemann-Siegel theta function. They provide a natural grid for locating zeros. At Gram points, Z(g_n) = (-1)ⁿ|ζ(½+ig_n)|, so the sign of Z alternates IF there's exactly one zero per interval. The first Gram point g₀ ≈ 17.845.
Gram's Law states (-1)ⁿZ(g_n) > 0, equivalent to exactly one zero in [g_{n-1}, g_n]. It holds ~73% of the time asymptotically. Violations occur in "Gram blocks" where zeros cluster. The famous Lehmer pair near g₁₂₆ shows two very close zeros, almost violating RH!
The explicit formula π(x) = Li(x) - Σ_ρ Li(x^ρ) - log(2) + ∫_x^∞ dt/(t(t²-1)log t) builds π(x) from zeta zeros ρ. Each zero contributes an oscillation. Animation shows how zeros accumulate to match π(x). RH controls error magnitude.
Watch how adding zeros reconstructs π(x)! Each zero ρ contributes an oscillating term.
Riemann's explicit formula expresses π(x) exactly in terms of Li(x) and contributions from each zeta zero: π(x) = Li(x) - Σ_ρ Li(x^ρ) - log(2) + ∫_x^∞ dt/(t(t²-1)log t). Each zero ρ = ½ + iγ contributes an oscillating term Li(x^ρ) ≈ -x^{½}cos(γ log x)/(γ log x). More zeros = more accurate approximation!
This formula proves that zeta zeros DIRECTLY control prime distribution! If RH holds (all Re(ρ)=½), each term decays like x^½, giving π(x) = Li(x) + O(√x log x). Zeros off the critical line would create larger oscillations. The formula is the mathematical proof that understanding zeros = understanding primes.
N(T) = #{ρ: 0 < Im(ρ) < T} counts zeros up to height T. Riemann-von Mangoldt: N(T) = (T/2π)log(T/2πe) + O(log T). The error S(T) encodes zero spacing statistics. Zero density estimates constrain possible RH violations.
Count of zeros with imaginary part less than T. Riemann-von Mangoldt: N(T) ~ (T/2π)log(T/2πe).
N(T) counts zeros ρ of ζ(s) with 0 < Im(ρ) < T. The Riemann-von Mangoldt formula gives N(T) = (T/2π)log(T/2πe) + O(log T). More precisely, N(T) = (1/π)θ(T) + 1 + S(T), where S(T) = (1/π)arg ζ(½+iT) is the "error" term.
RH implies S(T) = O(log T / log log T), much smaller than the unconditional O(log T). The oscillations in S(T) encode deep information about zero spacing. Large values of |S(T)| correspond to unusual zero distributions.
Domain coloring shows ζ(s) in the complex plane: phase → hue, modulus → brightness. Zeros appear as color wheel singularities. The critical line Re(s) = ½ and the pole at s = 1 are visible. Trivial zeros at s = -2, -4, -6, ... appear on the negative real axis.
Phase portrait of ζ(s). Zeros appear as color wheel centers. Critical line Re(s)=½ shown.
Domain coloring represents complex functions by mapping output to color: phase (argument) → hue, modulus → brightness. For ζ(s), zeros appear as points where all colors meet (full color wheel), and the pole at s=1 shows as a bright singularity. The critical strip 0 < Re(s) < 1 contains all nontrivial zeros.
RH states all nontrivial zeros lie on Re(s)=½. In domain coloring, this means all color-wheel centers (zeros) in the critical strip should align vertically on the critical line. The trivial zeros at s=-2,-4,-6,... are visible on the negative real axis.
On the real axis: ζ(s) has a pole at s=1, special values ζ(2)=π²/6, ζ(4)=π⁴/90, ζ(3)≈1.202 (Apéry). Trivial zeros at s=-2,-4,-6,... from the functional equation. For s<0, ζ(s) = 2^s π^{s-1} sin(πs/2) Γ(1-s) ζ(1-s).
Zeta on real line: pole at s=1, special values ζ(2)=π²/6, trivial zeros at s=-2,-4,-6,...
On the real axis, ζ(s) reveals its fundamental structure: a simple pole at s=1 with residue 1, the Basel problem ζ(2)=π²/6, Apéry's constant ζ(3)≈1.202, and trivial zeros at negative even integers s=-2,-4,-6,... from the functional equation. For s>1, ζ(s) = Σn^{-s} converges absolutely.
The functional equation ζ(s) = 2ˢπ^{s-1}sin(πs/2)Γ(1-s)ζ(1-s) connects values at s and 1-s. This explains why ζ(-2n)=0 (trivial zeros) and gives ζ(0)=-½, ζ(-1)=-1/12 (Ramanujan summation!).
Hugh Montgomery (1973) discovered that the pair correlation of zeta zeros follows R₂(x) = 1 - (sin πx/πx)². This matches GUE random matrix statistics! His famous encounter with Dyson at tea revealed the connection. Implies zeros "repel" each other.
Distribution of normalized gaps between consecutive zeros of ζ(s).
Hugh Montgomery (1973) discovered that the pair correlation of zeros of ζ(s) matches the eigenvalue statistics of random Hermitian matrices from the Gaussian Unitary Ensemble (GUE). The pair correlation function R₂(x) = 1 - (sin(πx)/(πx))² describes how zeros "repel" each other.
Freeman Dyson recognized Montgomery's result matched random matrix theory. This suggests deep connections between quantum chaos, nuclear physics (energy levels), and prime numbers. The zeros behave like eigenvalues of a random Hamiltonian!
Zeta zeros follow Gaussian Unitary Ensemble statistics from random matrix theory. The Wigner surmise P(s) = (π/2)s exp(-πs²/4) gives nearest-neighbor spacing. Level repulsion: P(0) = 0 (zeros don't cluster). This deep connection remains mysterious.
Nearest neighbor spacing distribution compared to random matrix predictions.
For GUE matrices, Wigner derived the nearest neighbor spacing distribution: P(s) = (32/π²)s² exp(-4s²/π). This shows level repulsion — small spacings are suppressed. Zeta zeros follow this remarkably well!
Random (uncorrelated) levels have Poisson spacing: P(s) = exp(-s). This has maximum at s=0, meaning small gaps are most likely. GUE zeros are anti-correlated, with P(0)=0. Zeta zeros behave like GUE, not Poisson!
Chebyshev noticed primes ≡ 3 (mod 4) tend to outnumber those ≡ 1 (mod 4). Rubinstein-Sarnak (1994) proved under GRH that 3 leads ~99.59% of the time! The bias comes from low-lying zeros of L-functions. "π(x;4,3) vs π(x;4,1)" race visualized.
Which residue class has more primes? Track the race as x increases.
Chebyshev (1853) noticed that primes ≡ 3 (mod 4) seem to outnumber primes ≡ 1 (mod 4). Though both classes have density 1/2 asymptotically, non-quadratic residues "win" more often. This is the Chebyshev bias.
Under GRH, primes ≡ 3 (mod 4) lead ~99.59% of the "time" (in logarithmic density). The bias connects to zeros of L-functions: L(s,χ₄) with χ₄(-1)=-1 causes the asymmetry.
L(s,χ) = Σ χ(n)/n^s generalizes ζ(s) using Dirichlet characters. The principal character gives ζ(s) times local factors. Non-principal L-functions are entire. GRH: all nontrivial zeros satisfy Re(s) = ½. They encode prime distribution in arithmetic progressions.
Compute L(s,χ) for all Dirichlet characters χ mod q.
For a Dirichlet character χ mod q: L(s,χ) = Σ χ(n)/nˢ = ∏ₚ (1-χ(p)/pˢ)⁻¹. When χ=χ₀ (principal), L(s,χ₀) = ζ(s)∏_{p|q}(1-p⁻ˢ). Non-principal L-functions are entire (no pole).
GRH states that ALL nontrivial zeros of ALL Dirichlet L-functions lie on Re(s)=½. This implies strong results about prime distribution in arithmetic progressions and the Chebyshev bias.
Each L(s,χ) has its own set of zeros, all conjectured on Re(s) = ½ (GRH). Low-lying zeros (small imaginary part) cause the Chebyshev bias. Comparing zero distributions across characters reveals universal behavior matching random matrix predictions.
Visualize zeros of Dirichlet L-functions. All should lie on Re(s)=½ (GRH).
Each primitive character χ mod q has its own L-function with infinitely many zeros in the critical strip. The zero-free region and zero density affect prime distribution in arithmetic progressions.
The zeros of L(s,χ) determine oscillations in π(x;q,a). Low-lying zeros (small imaginary part) cause the Chebyshev bias. If a zero existed with Re(ρ)>½, prime distribution in progressions would be badly behaved.
Hydrogen wavefunctions ψ_{nlm}(r,θ,φ) = R_{nl}(r)Y_l^m(θ,φ) have radial nodes at zeros of Laguerre polynomials. The quantization parallels prime factorization. Spherical harmonics Y_l^m connect to k-dimensional ball volumes. The Casimir operator eigenvalues mirror zeta special values.
Electron probability density |ψ|² for hydrogen-like orbitals. Nodes connect to zeta zeros!
Electron orbitals are described by wavefunctions ψ_{n,l,m}(r,θ,φ) = R_{nl}(r)Y_l^m(θ,φ). The radial part R_{nl} has exactly n-l-1 nodes (zeros), mirroring how ζ(s) zeros control prime distribution. The angular part Y_l^m are spherical harmonics — the same functions appearing in our higher-dimensional primitive counting!
Radial Nodes ↔ Zeta Zeros: Both control oscillations. R_{nl}(r) has n-l-1 zeros determining radial probability. ζ(s) zeros at ρ_k control oscillations in π(x). Higher n gives more nodes; higher T gives more zeta zeros.
Quantization ↔ Coprimality: Quantum numbers (n,l,m) are discrete like lattice points. Angular momentum l² = l(l+1)ħ² is quantized like gcd=1 constraint.
Y_l^m(θ,φ) = N_{lm} P_l^m(cos θ) e^{imφ} where P_l^m are associated Legendre polynomials. These are eigenfunctions of angular momentum operators, forming an orthonormal basis on the sphere — exactly what we use to analyze primitive lattice points in k dimensions via the k-ball volume formula!
Prime k-tuples generalize twin primes to patterns like (p, p+2, p+6) for prime triplets or (p, p+2, p+6, p+8) for prime quadruplets. The Hardy-Littlewood conjecture predicts their density using a product over primes. Admissible patterns (no residue class mod p covers all positions) can occur infinitely often. The first prime quadruplet is (5, 7, 11, 13).
Carmichael numbers are composite numbers n satisfying a^n ≡ a (mod n) for all integers a — they pass Fermat's primality test despite being composite. The smallest is 561 = 3·11·17. Korselt's criterion: n is Carmichael iff n is squarefree and (p-1)|(n-1) for all primes p|n. There are infinitely many (Alford-Granville-Pomerance, 1994).
Mersenne primes have the form M_p = 2^p - 1 where p is prime (necessary but not sufficient). They're connected to perfect numbers: if M_p is prime, then 2^{p-1}·M_p is perfect. The Lucas-Lehmer test efficiently determines primality. GIMPS (Great Internet Mersenne Prime Search) has found the largest known primes. As of 2024, 51 Mersenne primes are known, the largest being 2^82,589,933 - 1 with 24,862,048 digits.
Every real number has a continued fraction [a₀; a₁, a₂, ...] giving best rational approximations. Convergents p_n/q_n satisfy |x - p_n/q_n| < 1/q_n². Quadratic irrationals have eventually periodic expansions. The golden ratio φ = [1; 1, 1, 1, ...] has the slowest convergence. Famous: π = [3; 7, 15, 1, 292, ...], with 355/113 being exceptionally accurate.
The Stern-Brocot tree contains every positive rational exactly once, in lowest terms. Starting from 0/1 and 1/0, each fraction a/b has left child (a+c)/(b+d) using its ancestor c/d. The mediant property connects to Farey sequences. Path from root encodes the continued fraction. The tree is a complete binary tree organizing ℚ⁺ beautifully.
Pythagorean triples (a, b, c) satisfy a² + b² = c². Primitive triples (gcd = 1) are parametrized by a = m² - n², b = 2mn, c = m² + n² where gcd(m,n) = 1 and m-n is odd. The tree structure shows all primitives derive from (3,4,5) by three matrix transformations. There are infinitely many primitive triples, with density ~1/(2π) log N.
The function r₂(n) counts representations of n as a sum of two squares: n = a² + b² (including signs and order). Fermat's theorem: prime p is sum of two squares iff p = 2 or p ≡ 1 (mod 4). General n is representable iff no prime p ≡ 3 (mod 4) appears to an odd power. Jacobi's formula: r₂(n) = 4(d₁(n) - d₃(n)) where d_i counts divisors ≡ i (mod 4).
A quadratic residue mod p is an integer a where x² ≡ a (mod p) has a solution. The Legendre symbol (a/p) = 1 if a is a QR, -1 if not, 0 if p|a. Exactly (p-1)/2 non-zero residues are QRs. Quadratic reciprocity: (p/q)(q/p) = (-1)^{(p-1)(q-1)/4}. This "golden theorem" (Gauss) connects residue structure across primes.
The partition function p(n) counts ways to write n as a sum of positive integers, ignoring order. For example, p(5) = 7: 5, 4+1, 3+2, 3+1+1, 2+2+1, 2+1+1+1, 1+1+1+1+1. Hardy and Ramanujan proved the asymptotic formula p(n) ~ exp(π√(2n/3))/(4n√3). Ramanujan discovered remarkable congruences: p(5n+4) ≡ 0 (mod 5).
Bernoulli numbers Bₙ appear in the power sum formula 1^k + 2^k + ... + n^k and connect to ζ(-n). They satisfy ζ(2n) = (-1)^{n+1}B_{2n}(2π)^{2n}/(2(2n)!), explaining why ζ(2) = π²/6. The tangent function has Taylor coefficients involving Bernoulli numbers. B₁ = -1/2 (or +1/2 by convention), and all odd Bₙ = 0 for n ≥ 3.
The Fibonacci sequence F_n = F_{n-1} + F_{n-2} with F_1 = F_2 = 1 appears throughout mathematics and nature. The ratio F_n/F_{n-1} → φ = (1+√5)/2 ≈ 1.618 (golden ratio). Zeckendorf's theorem: every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Lucas numbers follow the same recurrence with L_1=1, L_2=3.
Catalan numbers C_n = (2n)!/((n+1)!n!) count numerous structures: valid parenthesizations, binary trees with n+1 leaves, paths below diagonal, triangulations of polygons, and more. They satisfy C_n = ΣC_iC_{n-1-i} and have generating function (1-√(1-4x))/(2x). The sequence 1, 1, 2, 5, 14, 42, 132, ... grows like 4ⁿ/(n^{3/2}√π).
The aliquot sequence of n iterates s(n) = σ(n) - n (sum of proper divisors). Perfect numbers are fixed points (s(n)=n). Amicable pairs satisfy s(a)=b, s(b)=a (e.g., 220↔284). Sociable numbers form longer cycles. The Catalan-Dickson conjecture asks if all sequences either terminate at 0, reach a perfect number, or enter a cycle. The sequence starting at 276 is famously unresolved.
The n-th cyclotomic polynomial Φₙ(x) is the minimal polynomial of primitive n-th roots of unity. It has degree φ(n) and integer coefficients. The factorization xⁿ - 1 = ∏_{d|n} Φ_d(x) connects roots of unity to divisibility. Cyclotomic fields ℚ(ζₙ) are fundamental in algebraic number theory and Fermat's Last Theorem.
Start with any positive integer n. If even, divide by 2; if odd, multiply by 3 and add 1. The Collatz conjecture states that this sequence always reaches 1. Despite its elementary statement, it remains unproven since 1937. Erdős said "Mathematics is not yet ready for such problems." Trajectories exhibit chaotic behavior with unpredictable stopping times.
A highly composite number (HCN) has more divisors than any smaller positive integer. Ramanujan studied them extensively in 1915. HCNs have the form 2^{a₁}·3^{a₂}·5^{a₃}... with a₁ ≥ a₂ ≥ a₃ ≥ ... They're "anti-primes" in some sense. Superior highly composite numbers minimize n^{1/d(n)} and have deep connections to the Riemann Hypothesis.
A perfect number equals the sum of its proper divisors: σ(n) = 2n. Euclid proved 2^{p-1}(2^p - 1) is perfect when 2^p - 1 is prime (Mersenne prime). Euler proved all even perfect numbers have this form. Whether odd perfect numbers exist is unknown — if they do, they exceed 10^{1500}. Only 51 perfect numbers are known.
Taxicab numbers are the smallest integers expressible as sums of two positive cubes in n different ways. Ta(2) = 1729 is famous from Hardy's visit to Ramanujan, who instantly recognized it as "the smallest number expressible as the sum of two cubes in two different ways": 1729 = 1³ + 12³ = 9³ + 10³. These connect to Fermat's Last Theorem and Diophantine equations.
Elliptic curves are cubic curves with a remarkable group structure. The set of rational points E(ℚ) forms a finitely generated abelian group (Mordell-Weil theorem). Over finite fields 𝔽_p, elliptic curves are fundamental to modern cryptography (ECC). The Birch and Swinnerton-Dyer conjecture connects the rank of E(ℚ) to the behavior of L(E,s) at s=1 — one of the seven Millennium Prize Problems.
This comprehensive research platform integrates 65 interactive visualization tools exploring number theory, from lattice points to the Riemann Hypothesis. Every tab features live dashboards, theory panels, preset examples, multiple charts, CSV export, and click-to-inspect modals.
This platform visualizes theorems and concepts developed by brilliant mathematicians over centuries:
Created by: Wessen Getachew (@7dview)
Philosophy: Making deep number theory accessible through interactive visualization. Every theorem deserves to be seen, not just read.
Technology: Pure HTML5/CSS3/JavaScript. No frameworks, no dependencies except Plotly.js for charts.
"The mathematician does not study pure mathematics because it is useful; he studies it because he delights in it and he delights in it because it is beautiful." — Henri Poincaré