Unified GCD Modular Framework

Complete Research Tool for Modular Arithmetic, Lattice Visibility, and Prime Structure
by Wessen Getachew (@7dview)

Mathematical Framework

Core Principle: For each modulus m ≥ 1 and residue r ∈ {0, 1, ..., m-1}, we define the angular location θm,r = 2πr/m on the unit circle.

GCD Classification: Each point is assigned to a GCD class based on gcd(r, m):

Gaussian Integer Connection: Primitive lattice vectors (a,b) with gcd(a,b) = 1 map to visible angles on the unit circle. When a² + b² = p (prime), these correspond to Gaussian primes with unique representations up to symmetry.

Density Result: The coprime channel density converges to 6/π² (Basel constant), demonstrating the fundamental connection between modular arithmetic and analytic number theory.

Modular Ring Configuration

Concentric Modular Rings: θ = 2πr/m

Statistics

Export Options

Gaussian Integer Lattice

Gaussian Integer Lattice: a² + b² Structure

Lattice Statistics

Export Options

Unit Circle Embedding

5

Unit Circle: e^(2πir/m) Embedding

Modular Statistics for m = 12

Farey Sequence Visualization

Farey Sequence Fn: Reduced Fractions

Farey Statistics

Modular Prime Sieve

Prime Sieve: Modular Structure

Sieve Analysis

Cayley/Smith Transform

90°
Transform: Γ = (z - 1)/(z + 1), where z = R·e^(iθ) and θ = 2πr/m + α

Smith Chart Transform

Prime Distribution Race: GCD Ladder Analysis

Analyze how primes distribute across GCD classes as range increases. Watch the "race" between different GCD residue classes.

50
Analyze primes p where p+g is also prime

Prime Race: Distribution Across GCD Classes for m = 30

Gap Analysis: Prime Pairs (p, p+2)

Prime Distribution Statistics

GCD Ladder Breakdown

Export Complete Analysis