한
← All rivers
River of knowledge

The River of Number Theory

Why have simple rules about integers kept generating new questions for millennia?

From Euclid's infinity of primes through Fermat, Gauss, and Wiles — 2,300 years chasing integer secrets.

300 BCE–20246 city-to-city segments

Read the current

What changed between the cities?

  1. 1

    300 BCE–1640

    problem revival

    AlexandriaToulouse

    From Endless Primes to Repeating Rules of Remainders

    In a letter to Frénicle dated 18 October 1640, Fermat stated that if p is prime and p does not divide a, then a^(p−1) leaves remainder 1 modulo p. No complete proof survives in that letter. The theorem helps test primality, but its converse fails: some composite numbers pass related tests.

    Proving That the Primes Never End — Book IX of the Elements → Seeing Repetition in Remainders Modulo a Prime — Fermat’s Little Theorem
    Place this segment on the map
  2. 2

    1637–1770

    problem correspondence

    ToulouseSaint Petersburg

    A Marginal Claim Gained Its First Exponent-by-Exponent Proof

    Euler used infinite descent to prove the case n = 3, but even he could not find a general proof and acknowledged the theorem’s difficulty.

    A Line in the Margin → Euler Proves the Case n = 3
    Place this segment on the map
  3. 3

    1737–1859

    conceptual synthesis

    Saint PetersburgBerlin

    A Product over Primes Became Oscillation in the Zeta Function

    Riemann’s Berlin Academy paper extended the zeta function into the complex plane and related its zeros to fluctuations in prime counting. The Riemann hypothesis says that the nontrivial zeros have real part one half. The prime number theorem was proved without the hypothesis in 1896, and even RH would not become a one-line next-prime formula.

    Connecting a Product over Primes to an Infinite Series — Euler → Hearing Prime Fluctuations through Zeta Zeros — Riemann
    Place this segment on the map
  4. 4

    1850–1955

    problem reformulation

    BerlinTokyo

    A Failed Integer Problem Opened a Bridge to Modular Forms

    Yutaka Taniyama and Goro Shimura proposed a deep connection between elliptic curves and modular forms. At the time, no one knew it would unlock Fermat’s theorem. Taniyama died at thirty-one.

    Kummer's Ideal Numbers — A New Horizon → The Taniyama–Shimura Conjecture
    Place this segment on the map
  5. 5

    1955–1994

    international theorem network

    TokyoPrinceton

    Modularity Closed the Door on Fermat's Counterexample

    Working with Richard Taylor, Wiles found a new argument that repaired the gap. The two revised papers passed review and were published in 1995; the required modularity result then implied Fermat’s Last Theorem.

    The Taniyama–Shimura Conjecture → The Proof Is Completed
    Place this segment on the map
  6. 6

    1949–2013

    distributed problem network

    PrincetonDurham, NH

    From Average Prime Laws to Infinitely Often Bounded Gaps

    Zhang proved that infinitely many consecutive-prime gaps are smaller than seventy million. Later Maynard–Tao ideas and Polymath collaboration greatly reduced the bound, while the exact gap-two twin-prime conjecture remains open. Finite computation, recurrence below some fixed bound, and infinitely many exact gap-two pairs are three different claims.

    Proving the Prime Number Theorem Again without Complex Zeros — Selberg and Erdős → Proving That Primes Come Boundedly Close Infinitely Often — Yitang Zhang
    Place this segment on the map

How to read the lines

Each line is an editorial route through problems, texts, and practices. It does not imply one book moving in a straight line, a sole invention, or identical adoption everywhere.