"The integers are the perfect balance between chaos and order." — Paul Erdős
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
| EXCELLENT | <0.3% error | n ≤ 5 |
| GOOD | 0.3-3% error | n ≤ 15 |
| FAIR | 3-8% error | n ≤ 30 |
| UNRELIABLE | >15% error | n > 30 |
The circular sector organization of Farey sequences is a genuinely new framework not present in classical literature. While Farey sequences and Stern-Brocot trees are well-known, mapping them to angular sectors and analyzing error bounds per-sector is original work. The geometric-arithmetic correlation between angular position and divisibility properties represents a novel discovery.
| n | ζ(n) | 1/ζ(n) | Closed Form | Interpretation |
|---|---|---|---|---|
| 2 | 1.6449340668 | 0.6079271019 | π²/6 | 60.79% of integer pairs are coprime |
| 3 | 1.2020569032 | 0.8319073726 | Apéry's constant | 83.19% of integer triples are coprime |
| 4 | 1.0823232337 | 0.9239393751 | π⁴/90 | 92.39% of 4-tuples are coprime |
| 6 | 1.0173430620 | 0.9829525700 | π⁶/945 | 98.30% of 6-tuples are coprime |
The connection between music and mathematics runs deep. Every musical interval corresponds to a rational number p/q, and the simplicity of this fraction determines its consonance. This is why the Farey sequence and Stern-Brocot tree—structures that organize all rationals—have profound musical significance.
When two frequencies are in a simple ratio (small p and q), their waveforms align periodically, creating consonance. Complex ratios create interference patterns perceived as dissonance.
Several mathematical measures quantify the "pleasantness" or consonance of intervals:
James Tenney's complexity measure. Lower values indicate simpler, more consonant intervals. The octave (2/1) has H_T = 1, the fifth (3/2) has H_T ≈ 2.58.
Giovanni Battista Benedetti's simpler multiplicative measure (1585). The unison has H_B = 1, the octave has H_B = 2, the fifth has H_B = 6.
Leonhard Euler's "degree of sweetness" (1739), based on prime factorization n = Π p_i^{e_i}. For an interval p/q: Γ(p/q) = Γ(p) + Γ(q) - 1. Lower values are more consonant.
Paul Erlich's information-theoretic measure. Models the uncertainty in identifying which simple ratio a listener perceives. Valleys in harmonic entropy correspond to stable intervals; peaks indicate ambiguous, tense intervals.
The prime limit of an interval p/q is the largest prime in the factorization of p·q. This determines which "harmonic space" the interval occupies:
| Limit | Name | Primes Used | Example Intervals | Character |
|---|---|---|---|---|
| 2 | 2-limit | 2 | Octave (2/1) | Pure octaves only |
| 3 | Pythagorean | 2, 3 | Fifth (3/2), Fourth (4/3) | Ancient Greek tuning |
| 5 | Just Intonation | 2, 3, 5 | Major 3rd (5/4), Minor 3rd (6/5) | Renaissance harmony |
| 7 | Septimal | 2, 3, 5, 7 | Septimal 7th (7/4), Blues 3rd (7/6) | Blues, barbershop |
| 11 | Undecimal | 2, 3, 5, 7, 11 | Neutral 3rd (11/9), Tritone (11/8) | Microtonal, neutral |
| 13 | Tridecimal | 2, 3, 5, 7, 11, 13 | 13/8, 16/13 | Extended just intonation |
The Enhanced Modular tool colors intervals by prime limit, revealing how different "harmonic families" distribute across the Farey sectors.
The cent is the standard unit for measuring musical intervals. One octave = 1200 cents, so each equal-tempered semitone = 100 cents.
| Interval | Ratio | Just Cents | Equal Tempered | Difference |
|---|---|---|---|---|
| Unison | 1/1 | 0 | 0 | 0 |
| Minor 2nd | 16/15 | 112 | 100 | +12 |
| Major 2nd | 9/8 | 204 | 200 | +4 |
| Minor 3rd | 6/5 | 316 | 300 | +16 |
| Major 3rd | 5/4 | 386 | 400 | -14 |
| Perfect 4th | 4/3 | 498 | 500 | -2 |
| Tritone | 45/32 | 590 | 600 | -10 |
| Perfect 5th | 3/2 | 702 | 700 | +2 |
| Minor 6th | 8/5 | 814 | 800 | +14 |
| Major 6th | 5/3 | 884 | 900 | -16 |
| Minor 7th | 9/5 | 1018 | 1000 | +18 |
| Major 7th | 15/8 | 1088 | 1100 | -12 |
| Octave | 2/1 | 1200 | 1200 | 0 |
Commas are small intervals representing the difference between two ways of reaching "the same" note. They reveal fundamental incompatibilities in tuning systems:
| Comma | Ratio | Cents | Origin |
|---|---|---|---|
| Syntonic | 81/80 | 21.5 | Four 5ths (81/16) vs Major 3rd + 2 octaves (80/16) |
| Pythagorean | 531441/524288 | 23.5 | 12 perfect 5ths vs 7 octaves |
| Diesis | 128/125 | 41.1 | Octave vs three major 3rds |
| Septimal | 64/63 | 27.3 | 7th harmonic discrepancy |
| Schisma | 32805/32768 | 2.0 | Pythagorean - Syntonic |
These commas explain why perfect tuning is mathematically impossible—you cannot stack simple ratios and return exactly to your starting point (except octaves).
The Stern-Brocot tree has remarkable musical properties:
The path directions (L/R) correspond to continued fraction coefficients, connecting the tree's structure to the best rational approximations of any real number.
When two frequencies are close, their interference creates audible "beats." The Plomp-Levelt model of roughness shows that:
This psychoacoustic foundation explains why the mathematical measures (Tenney, Euler) correlate with perceived consonance.
The Enhanced Modular tool implements all these concepts:
Primitive Lattice Points — A point (x,y) ∈ ℤ² is primitive (visible from origin) iff gcd(x,y)=1. The density of primitive points converges to 6/π² = 1/ζ(2) ≈ 0.6079 (Euler's Basel problem). This tab visualizes the lattice with 15+ color schemes, Smith chart transform, and modular overlays.
| R | Total | Primitive | Ratio | 6/π² Pred | Error % |
|---|
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 distinct prime factors, and 0 otherwise. It's the multiplicative inverse of the constant function 1 under Dirichlet convolution. The Mertens function M(x) = Σμ(n) for n≤x satisfies |M(x)| = O(x^{1/2+ε}) if and only if the Riemann Hypothesis is true.
Core identity: Σ_{d|n} μ(d) = [n=1] — The foundation of inclusion-exclusion
μ(n) = (-1)^k if n = p₁p₂...pₖ (k distinct primes), 0 if n has squared factor
| n | μ(n) | M(n) | Factorization | Squarefree |
|---|
The Cayley transform w = i(1+z)/(1-z) maps the unit disk to the upper half-plane. Farey points at angles 2π(p/q) on the circle map to rationals p/q on ℝ. Ford circles at rationals transform to horocycles. Per-ring rotation reveals modular tower structure.
Farey points at angle 2π(p/q) on |z|=1 map to p/q on ℝ via Cayley transform
The Möbius exponential sum measures how μ(n) interacts with oscillatory terms. The Riemann Hypothesis predicts |S(N,α)| = O(√N). Large deviations suggest deep arithmetic structures.
Square-free density → 6/π² ≈ 60.79% as N → ∞
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 |
|---|
Interactive ring visualization with gap analysis, power families (a^b), lift dynamics, Smith Chart transform, and Multiplication Table showing ring structure of Z/mZ. Explore units, zero divisors, idempotents, and Cayley tables.
Gap analysis reveals prime pair patterns: Gap 2 (Twin Primes), Gap 4 (Cousin Primes), Gap 6 (Sexy Primes). Coprime residue classes that differ by gap g correspond to admissible prime pair patterns. The φ(M) coprime classes form (ℤ/Mℤ)×, with structure revealed by direct lifts between moduli.
For any positive integer m, the set Z/mZ = {0, 1, 2, ..., m-1} forms a commutative ring under addition and multiplication modulo m. The multiplication table visualizes this complete structure.
Enter any element to analyze:
| Step | Calculation | Result |
|---|---|---|
| Asymptotic estimate | 3×30²/(π²×2×3) | 45.57 |
| Angular range | 360°/3 to 360°/2 | 120° - 180° |
| Fraction range | 1/3 < p/q ≤ 1/2 | width = 1/6 |
| Root mediant | (1+1)/(3+2) | 2/5 @ 144° |
| Error bound | O(30·log(30)/4) | ~25 |
Track residue trajectories through normalized phase space φ(r,m) = (r/m) mod 1 across moduli m ∈ [2, M]. Key Discovery: Residues r = p-1 (where p is prime) exhibit anomalously LOW trajectory drift, forming coherent "twin-prime shells" with statistical significance p < 0.001.
| r ▼ | Type | D(r) | L(r) | Var | φ̄ | Class |
|---|
For residue r and modulus m with gcd(r mod m, m) = 1, the normalized phase is φ(r,m) = (r/m) mod 1 ∈ [0,1). This tracks r's position on the unit circle across coprime moduli.
D(r) = Σ|φ(r,m+1) - φ(r,m)| summed over consecutive coprime moduli. Low drift indicates a coherent, stable trajectory. The drift metric captures how much the residue "jumps" around the circle.
Residues r = p-1 (where p is prime) have 1.76x LESS drift than primes themselves (t-test p < 0.001). This is NOT random fluctuation — it's a deep number-theoretic property forming geometric "shells."
• Core (D<0.3): Extremely coherent
• Halo (0.3-1): Highly coherent
• Periphery (1-3): Moderately coherent
• Dispersed (>3): Scattered trajectory
Two-sample t-test comparing (p-1) vs primes yields t ≈ -8.17, p < 4.24×10⁻¹⁴. The enrichment ratio (primes/p-1 drift) ≈ 1.76x holds consistently across different M values.
This framework connects to: Farey sequences (Hardy-Littlewood), equidistribution (Weyl), sieve theory (Selberg), and prime distribution oscillations (Maier). The geometric shell structure may predict prime constellation frequency.
The Enhanced Modular tool integrates music theory with number theory, revealing deep connections between Farey sequences, the Stern-Brocot tree, and musical consonance. Every coprime fraction p/q corresponds to a musical interval, and the tool provides comprehensive analysis including audio playback, consonance metrics, and chord building.
Quick buttons for fundamental intervals:
Build and play chords from selected fractions:
Tip: In Chord Mode, click multiple coprime points on the canvas to build custom chords!
For any selected fraction p/q, the tool calculates:
| Cents | 1200 × log₂(p/q) — standard musical measurement |
| Tenney Height | log₂(p) + log₂(q) — lower = simpler interval |
| Benedetti Height | p × q — multiplicative complexity (Benedetti, 1585) |
| Euler Gradus | Γ(p) + Γ(q) - 1 — "degree of sweetness" (Euler, 1739) |
| Harmonic Entropy | Information-theoretic smoothness (Erlich model) |
| Prime Limit | Largest prime in factorization of p·q |
Four specialized color modes for harmonic analysis:
| Harmonic (by q) | Colors by denominator: ● q=1 ● q≤4 ● q≤8 ● q≤16 ● q>16 |
| Prime Limit | ● 2-limit ● 3-limit ● 5-limit ● 7-limit ● 11-limit ● higher |
| Tenney Height | Gradient from simple (low complexity) to complex (high Tenney value) |
| Consonance | ● Perfect ● Imperfect ● Dissonant |
| Limit | System | Intervals | Musical Era |
|---|---|---|---|
| 2-limit | Octaves only | 2/1 | Universal |
| 3-limit | Pythagorean | 3/2, 4/3, 9/8 | Ancient Greece |
| 5-limit | Just Intonation | 5/4, 6/5, 5/3 | Renaissance |
| 7-limit | Septimal | 7/4, 7/6, 8/7 | Blues, Barbershop |
| 11-limit | Undecimal | 11/8, 11/9 | Microtonal |
The Stern-Brocot tree organizes all positive rationals by simplicity — exactly what musicians need:
Commas are small intervals revealing tuning incompatibilities:
| Syntonic (81/80) | 21.5¢ — Four 5ths vs M3+2 octaves |
| Pythagorean | 23.5¢ — 12 fifths vs 7 octaves |
| Diesis (128/125) | 41.1¢ — Octave vs three M3s |
| Septimal (64/63) | 27.3¢ — 7th harmonic discrepancy |
These explain why perfect tuning is mathematically impossible — you can't stack simple ratios and return exactly to the start.
The deep connection: when two frequencies f₁ and f₂ have ratio p/q (in lowest terms), their combined waveform repeats every q cycles of f₁ (or p cycles of f₂). Simple ratios create short, regular patterns — perceived as consonance. Complex ratios create long, irregular patterns — perceived as dissonance.
This is why the Farey sequence and Stern-Brocot tree — which organize rationals by simplicity — are fundamentally musical structures. The 6/π² coprime density means roughly 61% of random frequency pairs form "primitive" (irreducible) intervals.
Primes are equidistributed among coprime residue classes mod M. Watch the distribution evolve as N grows — confirming Dirichlet's theorem that each class gets ~π(N)/φ(M) primes!
UNIQUE TOOL: Animated prime distribution across coprime residue classes on the unit circle
Each coprime residue r (gcd(r,M)=1) is a point at angle 2πr/M. Size/color shows prime count in that class.
Bar chart showing prime count per coprime residue class. Dashed line = expected π(N)/φ(M).
Every coprime residue class mod M contains infinitely many primes, and they are equidistributed: each class gets approximately the same share. The animation shows this convergence in real-time!
Hierarchical structure of modular reduction in ℤ/Mℤ. Divisors of M form a partially ordered set (lattice) under divisibility, visualized as vertical layers. Farey chains connect residues to their canonical representatives.
Vertical levels represent divisor rings. Farey chains (gold lines) connect reducible residues to their reduced forms on inner layers.
The divisors of M form a partially ordered set (poset) under divisibility. This structure is visualized as a 3D lattice where each horizontal layer represents a quotient ring ℤ/M'ℤ for each divisor M' of M. The Farey chains (gold lines) connect each reducible residue r on the outer ring to its canonical representative r' = r/gcd(r,M) on the inner ring M' = M/gcd(r,M).
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 |
|---|
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 |
|---|
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.
9 unified tools for exploring the greatest unsolved problem in mathematics
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.
Visualize the Riemann zeta function as a sum of rotating phasors. Each term n^(-s) = n^(-sigma) e^(-it log n) is a vector with magnitude n^(-sigma) and angle -t log n. Enable Prime-Phase Vector Mode to sum over primes only with modular ring M, computing P_t(M) with coherence and cancellation metrics!
ENHANCED: Now includes Prime-Phase Vector mode by Wessen Getachew with modular ring integration
Prime-Phase Vector: P_t(M) = Σ [Mod(p,M) / p^(σ+it)] — Phase combines t·log(p) with modular 2πγp/M
Each vector: magnitude |n^(-s)| = n^(-sigma), angle arg(n^(-s)) = -t log n. Vectors drawn head-to-tail. Final point = zeta(s).
Magnitude |zeta(s)| vs t. Zeros occur where |zeta| = 0.
Each term is a phasor (rotating vector). On the critical line (sigma=1/2), the magnitudes decay as 1/sqrt(n) while angles rotate at rate log(n). At a zero, all phasors destructively interfere and the sum returns to origin. The animation shows how changing t causes the spiral to wind tighter or looser.
The modulus M defines the ring Z/MZ. The modular phase 2πγp/M ensures each prime's contribution respects the ring structure, analogous to Dirichlet characters.
Height t sets the imaginary part of s = σ + it on the critical line. Phase α·t·log(p) governs the rotation rate per prime.
Heuristic: When t is near a Riemann zero, prime phases align to cancel the sum, resulting in low |P_t| and high coherence. This "conspiracy" of primes is the heart of the RH connection.
Explore the phase function φ(p,t) = t·log(p) - π/2 for each prime p. At Riemann zeros, these phases exhibit remarkable alignment patterns. This tool visualizes how prime phases conspire at zeros of ζ(1/2 + it).
FROM ETHIOPIAN: Phase alignment visualization at zeta zeros
Each prime p plotted at angle φ(p,t) on unit circle. At zeros, phases cluster near specific values.
The phase of each prime's contribution to ζ(s) depends on t·log(p). At a zero t₀ of ζ(1/2 + it), the phases conspire to cancel the sum. This tool visualizes that conspiracy by showing how phases distribute among primes as t varies.
Unified workspace for computing π and ζ(2n) via Euler products, visualizing primes on modular rings, and exploring residue class geometry. Combines epsilon-targeted computation, prime ring visualization, and the complete Interactive Modular Lifting Rings framework.
Three tools in one: Euler Product Calculator + Prime Rings + Modular Geometry
Visualize electron orbitals ψ_{nlm}(r,θ,φ) for any element. Wavefunctions scale with atomic number Z: orbitals contract (r → r/Z) and energies increase (E → Z²E). The radial nodes mirror zeros of Laguerre polynomials, connecting to the Riemann zeta function. Spherical harmonics Y_l^m encode angular momentum quantization.
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!
The Wigner function W(x,p) represents quantum states in phase space (position × momentum). Unlike classical probability distributions, W can be negative — a signature of quantum behavior. For harmonic oscillators, eigenvalue spacing connects to RH via Montgomery-Odlyzko (GUE statistics). Coherent states are minimum-uncertainty Gaussians; Fock states show Laguerre polynomial structure.
W(x,p) = (1/πℏ) ∫ ⟨x+y|ψ⟩⟨ψ|x-y⟩ e^{2ipy/ℏ} dy — can be negative (quantum signature)
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.
For each fraction p/q in lowest terms, draw a circle tangent to the x-axis at x=p/q with radius 1/(2q²). Two Ford circles are tangent if and only if their fractions are Farey neighbors (|ad-bc|=1). This creates a beautiful tessellation connecting number theory to hyperbolic geometry. The circles never overlap and fill the upper half-plane.
The Calkin-Wilf tree enumerates all positive rationals using a different rule: node a/b has left child a/(a+b) and right child (a+b)/b. Like Stern-Brocot, every positive rational appears exactly once. The breadth-first traversal gives the Calkin-Wilf sequence, connected to hyperbinary representations. Compare with Stern-Brocot to see two beautiful orderings of ℚ⁺.
The Pisano period π(n) is the period of the Fibonacci sequence modulo n. For example, π(10)=60 since F₆₀ ≡ 0, F₆₁ ≡ 1 (mod 10). Remarkable properties: π(p) divides p²-1 for primes p, π(5)=20, π(2)=3. The patterns reveal deep connections between Fibonacci numbers and modular arithmetic.
Eisenstein integers ℤ[ω] where ω = e^(2πi/3) = (-1+√3i)/2 form a triangular/hexagonal lattice in the complex plane. Like Gaussian integers, they have unique factorization. Primes p ≡ 2 (mod 3) stay prime; p ≡ 1 (mod 3) splits. The 6 units are ±1, ±ω, ±ω². Compare with the square lattice of Gaussian integers.
For irrational α > 1, the Beatty sequence B_α = {⌊α⌋, ⌊2α⌋, ⌊3α⌋, ...} partitions ℕ with B_β where 1/α + 1/β = 1 (Rayleigh's theorem). For the golden ratio φ, B_φ and B_φ² are the lower and upper Wythoff sequences, connected to Fibonacci numbers. Every positive integer appears in exactly one sequence.
The Dedekind sum s(p,q) = Σₖ ((k/q))((pk/q)) where ((x)) = x - ⌊x⌋ - 1/2 is the sawtooth function. These sums satisfy the beautiful reciprocity law: s(p,q) + s(q,p) = (p²+q²+1)/(12pq) - 1/4. They appear in modular forms, topology (signature defects), and lattice point counting.
Minkowski's theorem: A convex body symmetric about the origin with volume > 2ⁿ contains a non-zero integer lattice point. This fundamental result connects geometry to number theory, proving existence of lattice points in regions. Applications include Diophantine approximation, algebraic number theory, and the four-square theorem.
Wheel factorization skips multiples of small primes when searching for larger primes. The mod-30 wheel (2×3×5) only checks residues {1,7,11,13,17,19,23,29} — just 8 of 30 numbers (26.7%). The mod-210 wheel (2×3×5×7) checks only 48 of 210 (22.9%). This visualization shows which residue classes can contain primes.
The nine imaginary quadratic fields ℚ(√-d) with class number 1 (unique factorization) provide natural moduli for prime constellation analysis. The Heegner numbers {1, 2, 3, 7, 11, 19, 43, 67, 163} generate norm-based sieves where N(a+b√-d) = a² + d·b². Prime splitting behavior directly relates to admissible gap patterns.
d ∈ {1, 2, 3, 7, 11, 19, 43, 67, 163} are the ONLY values giving class number h(-d) = 1, meaning unique factorization holds. Proven by Stark-Heegner-Baker theorem (1967).
N(a + b√-d) = a² + d·b². Multiplicative: N(αβ) = N(α)·N(β). Norms serve as natural moduli encoding prime splitting patterns.
Points with b > 0 correspond to the upper half-plane Im(z) > 0 in complex analysis. The b-coordinate is the coefficient of √-d, scaling the imaginary part.
Prime p splits ⟺ (-d/p) = 1 (Legendre). p inert ⟺ (-d/p) = -1. p ramifies ⟺ p|d. This determines which primes are representable as norms.
e^(π√163) ≈ 262537412640768743.99999999999925... The near-integer property comes from j(τ) being an algebraic integer for imaginary quadratic τ.
Using norms as moduli: if M = a² + d·b², then residues mod M encode splitting behavior, creating natural admissible patterns for prime constellations.
Enter any positive integer to explore its mathematical properties: factorization, divisors, totient, Möbius value, sum of squares representations, and connections to prime constellations.
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 84+ 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.
If this tool has helped your research, studies, or exploration of mathematics, consider supporting continued development!
Your support enables advanced mathematical visualization tools and open-source research!
Created by: Wessen Getachew (@7dview) · GitHub
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.
License: Educational use encouraged. Please cite when using in academic work.
"God made the integers, all else is the work of man." — Leopold Kronecker