Enhanced Modular Rings — Interactive Visualization

Farey sequences, Stern-Brocot trees, and modular arithmetic visualization

Theme:

Decimals:

Fractions

Enhanced Modular Lifting Rings

Visualize how numbers behave under modular arithmetic through concentric rings. Each ring represents a different modulus, with points colored by their relationships (coprime, composite, zero divisors). Watch patterns emerge as you explore different modular structures—from simple powers to prime sequences. Rotate, zoom, and inspect the deep patterns that connect number theory to geometry.

QUICK RANGE PRESETS

Core Settings

Modulus Selection −

Mode

Min Modulus

Max Modulus

Visualization Mode −

Visualization Mode

Visual Controls

Per-Ring Rotation +

Audio & Harmonic Analysis +

2D Modular Rings: θ = 2πr/M

2D Rings: Concentric rings showing residue classes mod M. Gold points = coprime residues (GCD=1). Each ring represents a modulus from min to max. Click any point to see details below.

Stern-Brocot Tree (Sector)

Quick Mod:

Max Depth

Mod Range 12

Zoom 1.0×

Label Size 10px

Label Color

Format

Labels Edges Tongues

Canvas

Find Path:

Tree depth: 0 | Nodes: 0

Arnold Tongues (Phase-Locking Regions)

⚠️ Epistemic Status: Heuristic Analogy

This visualization uses dynamical system structures (Arnold tongues) as an analogy for rational enumeration in number theory. This is exploratory visualization for intuition, NOT a proven equivalence.

Useful for teaching and pattern exploration. Not useful for proving theorems.

Arnold Tongues show regions of phase-locking in dynamical systems. Each tongue corresponds to a rational rotation number p/q. The width of tongue p/q grows with coupling strength ε. Points inside tongue p/q exhibit periodic orbits with rotation number exactly p/q.

Size

View

Max q

ε Max

Color

Labels Grid Fill Show Path Edges

Sector

Play:

Speed

Tongues: 0 | Max q: 8

Frequency Ratio Distribution

Distribution of frequency ratios across all coprime points. X-axis: frequency ratio (relative to base). Y-axis: count. Peaks correspond to simple ratios (consonant intervals).

Bins

Log scale Show peaks

Points: 0 | Range: 0-0

Farey Neighbors in Sector (|ad-bc|=1)

Loading...

Enhanced Lifting Rings Theory

θ = 2πr/M | Gap g: r₂ - r₁ ≡ g (mod M) with gcd(r₁,M) = gcd(r₂,M) = 1

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.

Multiplication Table — Ring Structure of Z/mZ (click to expand)

The Ring Z/mZ

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.

Units
Elements a where gcd(a,m)=1
Have multiplicative inverses
Count = φ(m)

Zero Divisors
Non-zero a where ab≡0 (mod m)
for some non-zero b
Count = m - φ(m) - 1

Idempotents
Elements where a²≡a (mod m)
Always include {0, 1}
Count = 2^ω(m)

Nilpotents
Elements where a^n≡0
Only exist when m has
repeated prime factors

Table Types

Multiplication (axb mod m): Full m×m table showing ring structure
Cayley Table (Units): Restricted to φ(m) invertible elements — the group (Z/mZ)×
Addition (a+b mod m): Always forms cyclic group of order m

Color Schemes

Rainbow: hue = (value/m) × 360° — reveals periodic patterns
Divisibility: Intensity by divisor count — darker = fewer divisors
Zero Divisors: Blue=units, Red=zero divisors, Gray=zero
Idempotents: Gold=idempotent elements, Gray=others

Element Inspector

Enter any element to analyze:

Units: Order (smallest k where a^k≡1), inverse, powers, generated subgroup
Non-units: Zero divisor pairs, nilpotent detection (a^n≡0)
Primitive roots: Units with order=φ(m) that generate all units

Prime vs Composite Moduli

Prime m (Field)

Only 0 gives 0 products
Every row is a permutation
All non-zero elements are units
Exactly 2 idempotents: {0,1}

Composite m (Ring)

Multiple zero divisor products
Some rows have gaps/repeats
Has non-invertible elements
2^ω(m) idempotents

Mathematical Presets

m=6 (Basel) m=12 (φ=4) m=17 (Prime Field) m=30 (Primorial) m=60 (Highly Composite) m=31 (Mersenne Prime)

Step-by-Step Sector Count Verification

Formula Derivation

Farey sequence |FQ| = 1 + Σk=1Q φ(k)
Asymptotic: Σφ(k) ≈ 3Q²/π² (Mertens)
Sector Sn = (1/(n+1), 1/n) has width 1/(n(n+1))
Relative width = [1/(n(n+1))] / 1 = 1/(n(n+1))
Count ≈ |FQ| × [1/(n(n+1))]
∴ C(n,N) ≈ 3N²/(π²·n(n+1))

Error Analysis

Primary: Σφ(k) ≠ 3Q²/π² exactly
Error term: O(Q log Q)
Secondary: Boundary effects
Fractions at 1/n, 1/(n+1) edges
Combined: O(N log N / n²)
Reliability degrades as n→∞

Worked Example: S₂ with N=30

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

Author: Wessen Getachew | GitHub | @7dview

𝔻 Farey Explorer — Unit Disk & Upper Half-Plane

FAREY SEQUENCE & CUSTOM POINTS

GENERATE FAREY SEQUENCE F_n

F_n max = current modulus m. Option to include 0/n for each n.

ADD ALL RESIDUES FOR MODULUS

Adds all fractions k/m for k = 0 to m-1 (includes 0/m)

QUICK PRESETS

CUSTOM POINTS (CLICK × TO REMOVE) 0 POINTS

No points added yet

Format: numerator/denominator (e.g., 1/3, 2/5, 3/7)

CONNECTION OPTIONS

Connect By

Line Width

Opacity

Point Size

Labels Grid Axes Unit Circle Coprime Only φ Ratio Sync Views

Canvas Size

Zoom1.0×

Phase0°

𝔻 Farey Unit Disk Explorer

Interactive Poincare Disk — Farey Fractions on Unit Circle

Farey points plotted on unit circle. Angular position: θ = 2π·(numerator/denominator). Colors by GCD value. Click points for details.

Total

points

COPRIME

Max Q

—

denom

Min Q

—

denom

AVG Q

—

mean

Min P/Q

—

frac

Max P/Q

—

frac

Span

—

range

Max P

—

numerator

MEDIAN Q

—

50th %ile

σ STD DEV Q

—

variance

Q Range

—

max-min

NON-COPRIME

—

FAREY DEPTH

—

F_n

Harmonic Analysis System — Complete Guide

Overview

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.

Audio Controls

Base Frequency: Reference pitch in Hz (default 440 = A4). All intervals calculated relative to this.
Volume: Master volume control (0-100%)
Duration: Note length from Short (0.15s) to 1 second
Waveform: Sine (pure), Triangle, Square, or Sawtooth oscillator

Interval Playback

Quick buttons for fundamental intervals:

Perfect Fifth (3:2): 702 cents — most consonant after unison/octave
Perfect Fourth (4:3): 498 cents — inversion of the fifth
Major Third (5:4): 386 cents — defines major tonality
Minor Third (6:5): 316 cents — defines minor tonality
Major Sixth (5:3): 884 cents — inversion of minor third
Octave (2:1): 1200 cents — same note, double frequency

Chord Builder

Build and play chords from selected fractions:

Chord Mode: Enable to add clicked points to chord instead of replacing selection
Play Chord: Play all selected notes simultaneously
Arpeggio: Play notes in sequence (lowest to highest)
Quick Chords: Preset major (4:5:6), minor (10:12:15), major 7th, power chord

Tip: In Chord Mode, click multiple coprime points on the canvas to build custom chords!

Consonance Metrics

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

Harmonic Color Schemes

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

Prime Limits Explained

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

Stern-Brocot Tree & Music

The Stern-Brocot tree organizes all positive rationals by simplicity — exactly what musicians need:

Mediant Property: Between a/b and c/d, the mediant (a+c)/(b+d) is the simplest fraction — used to find intermediate pitches
Path = Continued Fraction: The L/R path encodes the CF [a₀; a₁, ...], connecting to best approximations
Depth ≈ Complexity: Tree depth correlates with Tenney height — deeper = more complex interval
Path Sonification: Play the S-B path as an arpeggio to "hear" the approach to any fraction

Famous Tuning Commas

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.

Quick Start Guide

Select Harmonic (by q) or Prime Limit color scheme
Click any gold coprime point to hear its frequency
View Harmonic Metrics panel for full consonance analysis
Enable Chord Mode and click multiple points to build chords
Click Play Chord to hear all selected notes together
Use S-B Path to visualize and sonify the path to any fraction
Try the Manual p/q input to explore specific intervals
Compare Quick Chords (Major, Minor, Maj7, Power) to hear harmonic structure

Mathematical Foundation

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.

Mathematical Theory

Modular Arithmetic Fundamentals

For integers a, b and modulus M > 0, we write a ≡ b (mod M) when M divides (a - b). The set of residue classes forms the ring ℤ/Mℤ.

Units: Elements with multiplicative inverses. The unit group (ℤ/Mℤ)× has order φ(M).
Coprime residues: r is coprime to M iff gcd(r, M) = 1 iff r is a unit.
Zero divisors: Non-zero elements a where ab ≡ 0 for some non-zero b. Only exist when M is composite.

Euler's Totient Function

φ(M) counts integers 1 ≤ r ≤ M with gcd(r, M) = 1.

φ(M) = M · ∏p|M (1 - 1/p)

The density of coprimes approaches 6/π² ≈ 0.6079 as M → ∞, connecting to the Riemann zeta function: 1/ζ(2) = 6/π².

Farey Sequences & Stern-Brocot Tree

The Farey sequence F_n consists of reduced fractions p/q with 0 ≤ p/q ≤ 1 and q ≤ n, arranged in order.

Mediant property: Between adjacent Farey fractions a/b and c/d, their mediant (a+c)/(b+d) appears in higher-order sequences.
Stern-Brocot tree: Binary tree generating all positive rationals exactly once via iterated mediants from 0/1 and 1/0.
Ford circles: Circle of radius 1/(2q²) tangent to the real axis at p/q. Adjacent Farey neighbors have tangent Ford circles.

Sector Counting Asymptotics

For the sector S_n = [1/(n+1), 1/n], the coprime count follows:

|{(a,b) : gcd(a,b)=1, a/b ∈ Sn, b ≤ M}| ~ 3M²/(π²n(n+1))

The error term is O(M log M / n²), giving excellent asymptotic predictions for coprime density in angular sectors.

Riemann Zeta & Critical Line Mapping

The Riemann Hypothesis states that all non-trivial zeros of ζ(s) lie on the critical line Re(s) = 1/2.

Critical Strip: The region 0 < Re(s) < 1 where non-trivial zeros are conjectured to exist.
Hardy Z-Function: Z(t) = χ(1/2 + it)·ζ(1/2 + it), a real-valued function with zeros at ζ zeros.
Zero Detection: Z(t) changes sign at each zero. Bisection refinement locates zeros to arbitrary precision.
Critical Line Spiral: As t increases, ζ(1/2 + it) traces a spiral in the complex plane passing through origin (0,0) at each zero.

Z(t) = 2·Σ(n=1 to m) cos(ϑ(t) - t·log(n))/√n

where m = √(t/2π) and ϑ(t) = Riemann-Siegel theta

Connection to Primes: The oscillations in Z(t) directly relate to prime distribution via the explicit formula. Zero spacing patterns are governed by GUE (Gaussian Unitary Ensemble) law from random matrix theory.

Functional Equation & Symmetry

The zeta function satisfies the functional equation:

ζ(s) = χ(s)·ζ(1-s)

where χ(s) = 2^s π^(s-1) sin(πs/2) Γ(1-s)

This symmetry about Re(s) = 1/2 is crucial. If ρ = 1/2 + it is a zero, then so is its conjugate 1/2 - it, creating paired oscillations.

Γ = (Z - Z₀)/(Z + Z₀)

Originally from RF engineering, it provides a powerful visualization where circles of constant resistance and reactance reveal modular structures geometrically.

GCD Mapping Framework: Modular Coprimality Geometry

Definition: For modulus m, the GCD map assigns each residue r ∈ {1,2,...,m} to angular position θ_r = 2πr/m on the unit circle, with color determined by gcd(r,m).

GCD Map: r ↦ (θ = 2πr/m, color(gcd(r,m)), size ∝ coprimality)

Unit Disk Visualization:

  • Angular position: θ = 2π·(numerator/denominator)

  • Color: Determined by gcd value with coprime highlighting

  • Interactive: Click to inspect individual points

  • Real-time stats: Total points, coprime count, density percentage

Core Theorems:

Coprime Density: For prime p, φ(p) = p-1, giving density (p-1)/p → 1. For composite m = p·q, φ(m) = φ(p)·φ(q) = (p-1)(q-1).
Sector Persistence: Prime residues p maintain constant phase mod any modulus. Composites destructively interfere on mod-1 revaluation channels.
Symmetry Group: The symmetry Aut(ℤ/mℤ) acts on the GCD map, preserving coprimality structure. For m = p^k, only unit-preserving automorphisms exist.
Farey Connection: Reduced residues {r : gcd(r,m)=1} form Farey neighbors. The mediant (r₁+r₂)/(m+m) ≡ (r₁+r₂)/2m determines adjacency structure.

Geometric Interpretation:

Farey Sector Analysis: Formula vs. Exact Computation

This advanced analysis tool computes exact coprime residue counts across all moduli and compares them against the asymptotic formula C(n,N) ≈ 3N²/(π² n(n+1)). Visualize Farey sectors on interactive modular rings to understand error behavior and sector density patterns.

Key Features

Exact Coprime Count: Computes exact residue counts for all moduli up to N using GCD-based enumeration
Formula Comparison: Compares exact values against asymptotic formula with error analysis
Interactive Visualization: View coprime residues mapped onto modular rings, grouped by Farey sector
Error Analysis Charts: Dual charts showing absolute and relative error by sector, with exact vs. formula comparison
Detailed Statistics: Table with sector-by-sector breakdown including exact counts, estimates, and error metrics
Sector Explorer: Interactively select sectors to view distribution patterns of coprime pairs
High-Resolution Moduli: Supports N up to 500, revealing fractal-like Farey structures

How to Use

Set Maximum Modulus: Enter N (recommended range 50-300 for fast computation, up to 500 for detailed analysis)
Compute: Click "Compute & Visualize" to generate exact counts and analysis
Analyze Charts: View error patterns across sectors and compare formula accuracy
Explore Sectors: Use the sector selector to view individual sector patterns on the modular ring
Interpret Table: Review exact counts, formula estimates, absolute/relative errors by sector

The Formula

C(n, N) ≈ 3N² / (π² · n(n+1))

Interpretation: Predicts the number of coprime residue pairs (r,m) with gcd(r,m)=1 falling in the n-th Farey sector [1/(n+1), 1/n] for maximum modulus up to N. The formula provides an O(1) estimate avoiding the O(N² log N) cost of exact enumeration.

Research Applications

Asymptotic Analysis: Study how formula accuracy improves with N
Sector Density: Understand why smaller sectors (n=1,2,3) are much denser
Error Bounds: Analyze absolute and relative error scaling
Farey Properties: Explore structure of consecutive mediant fractions
Visualization Patterns: Observe fractal-like self-similar structure in Farey sectors

Computation Controls

Maximum Modulus N:

Formula Only Mode (for efficiency, N>20k recommended)

Canvas Color Mode:

Key Observations

Smaller sector indices (n=1, 2, 3) are much denser—the formula captures this well.
Relative error typically improves with larger N; for N > 100, most estimates are within 10%.
The formula provides a universal, O(1) prediction; computing exact counts requires O(N² log N).
Visualizing high ranges (N > 200) reveals the fractal-like structure of Farey sectors.

Reference & Credits

Mathematical Guarantees & Proof Status

This table indicates which components are proven mathematics versus exploratory/heuristic.

Component	What It Does	Status	Research Status
Modular Rings	Z/MZ structure, units	✅ Proven	Educational
Farey Sequences	Mediant enumeration	✅ Proven	Pedagogical
Stern-Brocot	Rational tree	✅ Proven	Pedagogical
Möbius Function	μ(n) definition	✅ Proven	Standard
Mertens Function	M(n) = Σμ(i)	✅ Proven	Standard
Zeta Product	ζ(s)^{−1} = Σμ(n)/n^s	✅ Proven	Standard
Hardy Z-Function	Z(t) visualization	✅ Proven*	Exploratory
Boundary Cancellation	Error oscillation visuals	⚠️ Experimental	Exploratory
Arnold Tongues	Dynamics ↔ NT mapping	⚠️ Heuristic	Exploratory

* Hardy Z status: Proven mathematics; RH status conditional; visualization is exploratory

What This Tool Does NOT Claim

❌ Proves the Riemann Hypothesis — RH remains unproven. Visualization is not proof.
❌ Establishes new bounds on zeta zeros — All bounds are known from existing literature.
❌ Gives new insights into prime distribution — Observations are consistent with known theory.
❌ Verifies unproven conjectures — Numerical verification is not mathematical proof.
❌ Establishes theorem-level results from patterns — Patterns suggest conjectures, not theorems.

Author

Wessen Getachew

Twitter: @7dview

GitHub: wessengetachew.github.io

Core Features

GCD Mapping Framework: Modular coprimality geometry with unit disk visualization and coprime highlighting
Unified Visualization Controls: Synchronized labeling, coloring, and grid/density settings across all visualizations
Interactive Point Inspection: Hover/click tooltips showing detailed information for selected points
Modular Ring Visualization: Concentric rings showing residue classes with coprime density analysis
Farey Sector Analysis: Angular sectors with asymptotic counting formulas and error bounds
Stern-Brocot Tree: Interactive tree with path highlighting and mediant computation
Upper Half-Plane Visualization: Hyperbolic geometry with Ford circles and geodesic arcs
Hardy Z-Function Explorer: Riemann zeta zero detection on critical line with zero crossing analysis
Multiple Color Schemes: 7+ professional color palettes for different analysis contexts
Smith Chart Transform: Complex plane Mobius transformation for geometric analysis
Boundary Cancellation Analysis: Error term visualization and growth exponent calculation for k-dimensional lattices
Growth Exponent Calculator: Log-log linear regression to determine scaling law exponents with confidence intervals
Number Theory Toolkit: GCD calculator, Mobius function, primality testing, Euler totient computation
Error Analysis Chart: Multi-dimensional error term visualization with configurable radius and dimension parameters
Mobius Wave Visualization: Mertens function (cumulative Mobius sum) with oscillation pattern analysis and cancellation statistics
High-Precision Computation: Unlimited data point generation with radius up to 1,000,000

Mathematical References

Number Theory Foundations:
- Hardy, G.H. & Wright, E.M. — An Introduction to the Theory of Numbers (Oxford University Press, 2008)
- Apostol, T.M. — Introduction to Analytic Number Theory (Springer, 1976)
- Ireland & Rosen — A Classical Introduction to Modern Number Theory (Springer, 1990)
- Graham, Knuth & Patashnik — Concrete Mathematics (Addison-Wesley, 1994)
Modular Arithmetic & GCD:
- Niven, I., Zuckerman, H.S. & Montgomery, H.L. — An Introduction to the Theory of Numbers (John Wiley & Sons, 2008)
- Dickson, L.E. — History of the Theory of Numbers (Chelsea Publishing, 1971)
- Rademacher, H. & Grosswald, E. — Dedekind Sums (Carus Mathematical Monographs, 1972)
Farey Sequences & Stern-Brocot Trees:
- Calkin, N. & Wilf, H.S. — "Recounting the rationals" American Mathematical Monthly, 2000
- Hinman, P.G. — Fundamentals of Mathematical Logic (A.K. Peters, 2005)
- Vinson, J. — "The Stern-Brocot tree" Mathematical Gazette, 1990
Hyperbolic Geometry & Upper Half-Plane:
- Beardon, A.F. — The Geometry of Discrete Groups (Springer, 1983)
- Katok, S. — Fuchsian Groups (University of Chicago Press, 1992)
- Carleson, L. & Gamelin, T.W. — Complex Dynamics (Springer, 1993)
Riemann Zeta Function & Critical Line:
- Edwards, H.M. — Riemann's Zeta Function (Dover Publications, 2001)
- Titchmarsh, E.C. — The Theory of the Riemann Zeta-Function (Oxford, 1986)
- Ivic, A. — The Riemann Zeta-Function (John Wiley & Sons, 1985)
- Conrey, B.J. — "The Riemann Hypothesis" Notices of the AMS, 2003
Visualizations & Complex Analysis:
- Ahlfors, L.V. — Complex Analysis (McGraw-Hill, 1979)
- Needham, T. — Visual Complex Analysis (Oxford, 1997)
- Trott, M. — The Mathematica GuideBook for Symbolics (Springer, 2006)
Original Framework Contributions (Getachew, 2025):
- GCD Mapping Framework: Modular coprimality geometry via angular residue placement
- Unified Multi-Canvas Visualization: Synchronized controls for Farey disk, upper half-plane, Ford circles, and GCD mapping
- Circular Sector Organization: Asymptotic formula C(n,N) ≈ 3N²/(π²·n(n+1)) for coprime density in sectors S_n = [1/(n+1), 1/n]
- Hardy Z-Function Integration: Zero-detection and critical line visualization with multi-format export
- Interactive Labeling Systems: 8 complementary mathematical lenses for single residue representation

Key Mathematical References

Ring Theory & Modular Arithmetic:

Dummit, D. S., & Foote, R. M. (2004). Abstract Algebra (3rd ed.). Wiley.
Hardy, G. H., & Wright, E. M. (1979). An Introduction to the Theory of Numbers (5th ed.). Oxford.

Farey Sequences & Stern-Brocot Trees:

Calkin, N., & Wilf, H. S. (2000). Recounting the rationals. AMM, 107(4), 360-363.
Graham, R. L., Knuth, D. E., & Patashnik, O. (1994). Concrete Mathematics (2nd ed.).

Möbius, Mertens, & Zeta Function:

Tenenbaum, G. (2015). Introduction to Analytic and Probabilistic Number Theory (3rd ed.). AMS.
Titchmarsh, E. C. (1951). The Theory of the Riemann Zeta-Function. Oxford University Press.

Hardy Z-Function & Critical Line:

Odlyzko, A. M. (1997). The 10^20-th zero of the Riemann zeta function and 70 million neighbors. AT&T Labs.

Experimental Mathematics:

Borwein, J. M., & Bailey, D. H. (2008). Mathematics by Experiment (2nd ed.). A K Peters.

Libraries Used

Plotly.js — Interactive charts and visualizations
html2canvas — Screenshot export functionality
Web Audio API — Harmonic sonification

Formal Abstract

index-zeta-enhanced: An Interactive Framework for Exploratory Computation in Analytic Number Theory

We present an open-source interactive computational environment for exploratory visualization of number-theoretic structures. The platform comprises six integrated tools for studying modular rings, Farey sequences, Stern-Brocot trees, Hardy Z-function, GCD mapping, and boundary cancellation error analysis. While no new theorems are proven, we demonstrate computational feasibility of interactive multi-dimensional error visualization and pattern discovery in cancellation structures. All computations are verified against known results.

Keywords: number theory, visualization, experimental mathematics, Möbius inversion, boundary cancellation, Hardy Z-function

Research Mode: Publication-Ready Export

To use visualizations in research papers or presentations:

Generate your visualization by setting parameters
Click Export button (PNG, SVG, or CSV)
Cite in your work: "Generated using index-zeta-enhanced [citation]"
Note in caption: "Computational exploration; see methods for interpretation"

The tool serves research as an exploratory platform. Visualizations are illustrations, not proofs.

This tool is open source. Contributions and feedback welcome!

"The integers are the perfect balance between chaos and order." — Paul Erdős

Number Theory Computational Tools

Supporting calculations for research and verification:

GCD Calculator: Computes greatest common divisor using Euclidean algorithm. Verifies coprimality (gcd=1) and factors numbers.
Mobius Function μ(n): Returns -1 if n is product of odd number of distinct primes, +1 if even, 0 if n has squared prime factor. Critical for Möbius inversion formula.
Primality Test: Determines if integer is prime using trial division. Essential for factorization and distribution analysis.
Euler Totient φ(n): Counts integers 1 to n coprime to n. Given by formula φ(n) = n·∏(1-1/p) over primes p dividing n. Directly related to ζ(2) = π²/6 density constant.

Research Use: These tools enable rapid verification of theoretical predictions and numerical exploration of number-theoretic patterns underlying boundary cancellation.

Error Analysis via Visualization

Plotting Δ(R) versus R across dimensions k reveals scaling relationships.

Absolute error: Δ(R) = |N(R) - R^k/ζ(k)|

Relative error: δ(R) = Δ(R) / R^k

Multi-dimension comparison: k=2,3,4,5 on single chart

Visual Patterns: Linear curves on log-log scale indicate power law behavior. Comparing multiple dimensions shows how error exponent (k-1)/k improves with dimension. Relative error curves converge to zero, confirming asymptotic formula.

Mobius Wave and Cancellation Patterns

The Mertens function M(n) = Σ μ(d) from d=1 to n reveals cumulative Möbius cancellation.

M(n) = Σ(d=1 to n) μ(d)

Oscillation range: [min M, max M] shows cancellation amplitude

Cancellation ratio: M(n)/n approaches 0 as n grows (Riemann Hypothesis)

Significance: The oscillations of M(n) are intimately related to prime distribution. By the prime number theorem, M(n) = o(n), meaning it grows much slower than n. This is equivalent to the prime number theorem and related to RH.

Boundary Connection: The incomplete cancellation of μ at the truncation radius R directly causes the error term O(R^(k-1)) in the boundary formula.
Wave Intensity: Adjustable intensity parameter scales oscillations for better visualization of cancellation patterns.
Zero Properties: M(n) crosses zero infinitely often, but stays bounded (conjectured). Riemann Hypothesis equivalent: M(n) = O(n^(1/2+ε)).

Boundary Cancellation Principle

⚠️ EPISTEMIC STATUS: EXPERIMENTAL & EXPLORATORY

What we compute: Exact partial sums N_k(R) = Σ_{d≤R} μ(d) ⌊R/d⌋^k and error E_k(R) = N_k(R) − R^k/ζ(k)

What we observe: Error oscillations; correlations with Möbius wave; dimensional dependence. This is exploratory visualization of known mathematical structures.

What we do NOT claim:
✗ New theoretical bounds
✗ Theorems about error behavior
✗ Proofs of conjectures

Status: This is exploratory computation useful for pattern-finding and intuition-building. It is NOT a proof mechanism.

Use this tool for: visual exploration of error oscillation patterns, understanding Dirichlet convolution behavior across dimensions, generating conjectures for further theoretical research.

Fundamental Theorem

For a k-dimensional lattice region with radius R and Möbius-filtered arithmetic constraints (coprimality, k-free conditions, etc.):

N(R) = Rk / ζ(k) + O(Rk−1)

Error exponent: (k−1)/k

Geometric origin: (k−1)-dimensional boundary dominance

Interpretation: The error is not analytic but geometric—it arises from boundary truncation effects in the Möbius inversion framework. As dimension increases, the boundary becomes relatively smaller, improving the relative error bound.

Configuration & Parameters

Dimension k:

Radius R (1 to 1,000,000):

Higher radius = more points computed

Structure:

Results: Unlimited data | Formula: N(R) = R^k/ζ(k) + O(R^(k-1)) | Real-time computation

Results & Statistics

Main Term

—

Error Bound

—

Zeta Constant

—

Error Exponent

—

Analytical Results Table

Structure	k	Main Term	Error Term	ζ(k)
Run computation to see results

All Computed Points (No Limit)

Index	Value	Norm	Surviving	GCD/Factor
No data

Classical Examples Reference

Problem Class	Dimension	Leading Term	Error Exponent
Squarefree integers	k=2	6N/π²	O(√N)
Cubefree integers	k=3	N/ζ(3)	O(N^(1/3))
k-free integers	k	N/ζ(k)	O(N^(1/k))
Coprime pairs	k=2	6R²/π²	O(R)
Coprime m-tuples	m	R^m/ζ(m)	O(R^(m−1))

Key Insight

The error exponent (k−1)/k is not a computational artifact but a geometric necessity. It arises because:

Interior: Möbius inversion produces near-perfect cancellation
Boundary: Only (k−1)-dimensional surface where truncation occurs
Scaling: Error contribution scales with boundary measure = O(R^(k−1))

Growth Exponent Calculator

Calculate α in Δ(R) ∝ R^α using data points from the analysis.

Min Radius (R₁):

Max Radius (R₂):

Step Size:

Dimension k:

Growth Exponent

—

Fit Quality (R²)

—

fit

Confidence (95%)

—

±σ

Number Theory Tools

GCD Calculator

Result:

—

Möbius Function μ(n)

μ(n):

—

Prime Test

Result:

—

Euler Totient φ(n)

φ(n):

—

Error Analysis Chart - Δ(R) vs R

Max Radius:

Step Size:

Show Error Type:

k=2 k=3 k=4 k=5 k=10 k=20

Möbius Wave Analysis

Visualize the cumulative sum M(R) = Σ μ(d) to reveal cancellation patterns.

Max N (Mertens Function):

Wave Intensity:

Legend: Colors represent different k dimensions | Click chart areas to inspect detailed values | Zoom available via mouse scroll

Oscillation Range

—

min to max

Current M(N)

—

sum

Cancellation Ratio

—

M(N)/N