Pi hiding in prime regularities

The video reveals a deep connection between prime numbers, complex numbers, and π by deriving the alternating infinite sum π = 4(1 − 1/3 + 1/5 − 1/7 + …) through a geometric counting of lattice points inside a circle. The key move is reframing lattice points as Gaussian integers, where factoring in the complex plane exposes a hidden regularity: primes congruent to 1 mod 4 split into conjugate factors and contribute multiple lattice-point choices, while primes congruent to 3 mod 4 remain unsplit and contribute only in even powers. A multiplicative character χ elegantly encodes these prime-factorization patterns, transforming the chaotic-looking counts into sums over divisors. By organizing integers into divisor columns, the counting simplifies dramatically and directly yields the alternating sum, equating it with the circle’s area πr². Ultimately, the video shows that the apparent simplicity of the π formula stems from the unique prime factorization structure inside Gaussian integers, bridging geometry, number theory, and analysis.

• ▶ 0:11 The video braids together prime numbers, complex numbers, and π, aiming to reveal a formula for π as an alternating infinite sum.
• ▶ 1:04 The deeper goal is not just to prove the sum, but to uncover the hidden circle behind it—showing a regularity in how primes behave in the complex plane.
• ▶ 1:44 The roadmap moves from lattice points in a circle, to sums of two squares, to factoring in Gaussian integers, then to a special function χ whose pattern simplifies dramatically with a shift in perspective.
• ▶ 2:44 Lattice points are points with integer coordinates, and the number of lattice points inside a circle is approximately its area, (\pi r^2), with the estimate improving for very large circles.
• ▶ 3:33 A second counting method groups lattice points by "rings"—each point ((a,b)) lies on a circle of radius (\sqrt{a^2+b^2}), so only rings with radii equal to square roots of integers matter.
• ▶ 4:56 Counting points on a ring reduces to counting integer solutions to (a^2+b^2=n), a pattern that looks chaotic but is deeply connected to the distribution of primes.

• ▶ 5:48 Reframing lattice points as complex numbers lets (3^2+4^2) become ((3+4i)(3-4i)), turning a geometry/distance problem into a factoring problem.

• ▶ 7:43 The lattice points (a+bi) are the Gaussian integers; counting points at distance (\sqrt{25}) becomes counting Gaussian integers with (z\bar{z}=25).

• ▶ 9:41 Gaussian integers have unique prime factorization only up to units ((-1, i, -i)), so analyzing how ordinary primes factor as Gaussian primes explains the lattice-point count patterns.

• ▶ 10:28 Prime numbers congruent to 1 mod 4 (e.g., 5, 13, 17) always factor into two distinct Gaussian primes, and their square-root circles always hit exactly 8 lattice points.
• ▶ 11:03 Primes congruent to 3 mod 4 (e.g., 3, 7, 11) remain Gaussian primes and never hit lattice points, creating the key regularity that will be exploited.
• ▶ 12:00 The prime 2 is special: it factors as (2=(1+i)(1-i)), but those factors are 90-degree rotations of each other, so it must be treated differently.
• ▶ 12:54 The core recipe for counting lattice points: factor n, arrange conjugate Gaussian prime pairs into two columns, distribute copies between columns, then multiply by units (1, i, −1, −i).
• ▶ 13:38 For split primes like 5, the exponent gives k+1 distribution choices: e.g., for 25 = 5² there are 3 choices (3+4i, 5, 3−4i), and after the 4 unit rotations this yields 12 lattice points.
• ▶ 16:27 Non-split primes like 3 complicate the count: an odd exponent means zero lattice points, while an even exponent adds exactly one balanced choice and no new freedom, so the final count is (split-prime choices) × 4.
• ▶ 20:16 The section introduces the chi function (χ) to handle prime factorization uniformly: primes 1 above a multiple of 4 split into Gaussian factors, primes 3 above a multiple of 4 do not, and even numbers get χ = 0.
• ▶ 21:24 χ is multiplicative, so χ(a)·χ(b) = χ(ab), and its cyclic values (1, 0, −1, 0, …) let each prime-power contribution be rewritten as a sum over χ(1)+χ(p)+χ(p²)+…+χ(p^k).
• ▶ 22:11 For p^k, summing χ over powers encodes the lattice-point choices: primes like 5 (1 mod 4) give multiple options, primes like 3 (3 mod 4) give one option for even powers and zero for odd powers, and powers of 2 contribute one option; the final factor of 4 is kept at ▶ 23:42 for the i, −1, −i, 1 choices.

• ▶ 24:39 Expanding the multiplicative factor expression for 45 shows that because χ is multiplicative, every combination corresponds to a divisor—so the sum becomes 4 × (χ(1) + χ(3) + χ(5) + χ(9) + χ(15) + χ(45)), covering every divisor exactly once.

• ▶ 25:20 The big-picture counting strategy emerges: lattice points inside a large circle can be counted by summing over every integer n up to r² the number of lattice points at distance √n, which equals 4 times the sum of χ(d) over all divisors d of n.

• ▶ 26:07 The constant factor 4 is deliberately set aside for later, and the video notes that these divisor sums initially look random—depending on each integer's factorization—setting up the next stage of the argument.

• ▶ 26:26 The key insight is to count lattice points by organizing numbers into divisor columns rather than needing exact prime distribution, counting how many integers from 1 to r² are divisible by each d (e.g., half divisible by 2, a third by 3) with approximations improving as r grows.

• ▶ 27:55 Assembling these divisor counts and factoring out r² yields the alternating sum 1 - 1/3 + 1/5 - 1/7 + …, which equates the lattice-point expression with πr², thereby recovering the connection to π.

• ▶ 28:21 The simplicity of the resulting sum is explained by the regular prime factorization within Gaussian integers, leading into algebraic number theory and analytic number theory—fields that study systems like Gaussian integers and L-functions involving characters such as χ.

• ▶ 0:04 Introduction and Roadmap (0:04 - 2:35) - - Sets up the story linking prime numbers, complex numbers, and π, and lays out the plan from lattice points to a hidden prime pattern.
• ▶ 2:35 Lattice Points on Circles (2:35 - 5:48) - - Explores counting lattice-point rings with examples such as radius √25 and radius √11.
• ▶ 5:48 Complex Numbers and Gaussian Integers (5:48 - 10:28) - - Rephrases lattice-point questions using complex numbers and Gaussian integers, then reviews unique factorization.
• ▶ 10:28 Gaussian Prime Factorization and the Special Prime 2 (10:28 - 12:54) - - Shows how Gaussian primes split according to residue mod 4, including the special prime 2, and how conjugate products count lattice points.
• ▶ 12:54 The Lattice-Point Counting Recipe (12:54 - 20:16) - - Builds the norm-counting recipe, tests it with examples like 125, and handles non-splittable primes like 3 and factors of 2.
• ▶ 20:16 The Chi Function and Encoding Prime Choices (20:16 - 23:49) - - Introduces the cyclic multiplicative chi function to encode the prime-power choices in the lattice-point count.
• ▶ 23:49 Divisor Expansion and Counting Inside a Circle (23:49 - 26:30) - - Uses example 45 to expand the count into divisor sums and assembles the total count of lattice points inside a circle.
• ▶ 26:30 From Divisor Columns to π and Number Theory Branches (26:30 - 29:22) - - Organizes lattice points by divisor columns, relates the resulting sum to π via Gaussian integers, and closes with algebraic vs. analytic number theory.