Toward advanced number theory

← All goal-oriented paths · Start at the foundations

Start with elementary arithmetic, then choose algebraic, analytic or modular directions.

Why is 13=22+3213=2^2+3^2, while 11 cannot be written as a sum of two integer squares? Reducing squares modulo 4 rules out 11 immediately: a square leaves remainder 0 or 1. Proving that every prime congruent to 1 modulo 4 is a sum of two squares requires a more substantial idea. This movement between a calculation, an obstruction, and a general existence theorem is characteristic of number theory. It also explains why elementary questions can lead toward algebra, analysis, or geometry without any one of those subjects supplying the whole story.

Begin with arithmetic

A good first spine is William Stein's Elementary Number Theory: Primes, Congruences, and Secrets. Begin with Chapters 1 and 2, especially the Chinese remainder theorem in Section 2.2. Solve a pair of congruences by hand, then explain why the solution is unique modulo the product when the moduli are coprime. Continue to Chapter 4 on quadratic reciprocity; Section 5.7 returns to sums of two squares. This gives a connected project rather than a collection of unrelated tricks. The computational examples are useful experiments, but the proofs explain which patterns persist.

You can start the arithmetic with induction, divisibility, and some experience writing proofs. Stein assumes some basic abstract algebra for the book as a whole, so keep quotient rings, finite groups, and fields available for review. To decide whether to skip the opening material, try proving Bézout's identity, finding an inverse modulo 35 when it exists, and explaining why cancellation modulo a composite number needs a hypothesis. If these are routine, move to reciprocity or continued fractions. If they are not, a short return to the Euclidean algorithm will be more useful than pushing through unfamiliar notation.

Three ways the subject opens up

The algebraic branch asks what happens when integers are replaced by algebraic integers. In Z[−5]\mathbb Z[\sqrt{-5}], the two decompositions 6=2⋅3=(1+−5)(1−−5)6=2\cdot3=(1+\sqrt{-5})(1-\sqrt{-5}) suggest that familiar factorization arguments need repair. James S. Milne's Algebraic Number Theory supplies a later route: use Chapter 1 to identify missing commutative algebra, then study Chapter 2 on rings of integers and Chapter 3 on Dedekind domains and ideal factorization. Before beginning, you should be able to use ideals, quotient rings, and finite field extensions in examples. Calculate in a quadratic field alongside the general theory; otherwise ideals can become names for a repair you have never seen working.

An analytic direction starts from different questions: how many primes lie below a large bound, or how evenly are they distributed among residue classes? Here estimates, series, and complex functions become central. Prepare real and complex analysis for this branch as those tools arise. Completing algebraic number theory first is unnecessary. Conversely, familiarity with congruences does not make contour integration or convergence arguments automatic. Choose a first analytic project small enough that you can distinguish an exact identity from an asymptotic statement and identify the error being controlled.

For a connection with geometry, Milne's Modular Functions and Modular Forms offers a later alternative. Read its introduction for motivation, then the preliminaries and the discussion of modular curves as Riemann surfaces before Section 4 on modular forms. Its stated preparation includes advanced undergraduate algebra and complex analysis. The boundary conditions at cusps matter just as much as the transformation formula; ignoring them changes the objects under study.

Keep examples within reach

Keep a notebook of worked examples and failed conjectures: noncoprime congruences, quadratic residues for small primes, and competing factorizations. For each theorem, record where its hypotheses enter. Then choose a next branch by the question you want to answer: continued fractions for approximation, ideals and valuations for arithmetic in fields, analytic estimates for distribution, or elliptic curves and modular forms for arithmetic geometry. There is no need to turn these branches into one compulsory reading sequence.

Sources for this introduction
  • Elementary Number Theory: Primes, Congruences, and Secrets — William Stein. January 23, 2017 version; Chapters 1–2, especially Section 2.2 (The Chinese Remainder Theorem), Theorem 2.2.2; Chapter 4 (Quadratic Reciprocity); Section 5.7 (Sums of Two Squares).. Checked 2026-10-16.
  • Algebraic Number Theory — James S. Milne. Version 3.08 (2020); Chapters 1–3: Preliminaries from Commutative Algebra; Rings of Integers; Dedekind Domains; Factorization. Chapter 3 subsections Unique factorization of ideals and The ideal class group; Theorem 3.29.. Checked 2026-10-16.
  • Modular Functions and Modular Forms (Elliptic Modular Curves) — James S. Milne. Version 1.31 (2017); Prerequisites and Introduction; Part I, Sections 1–2 (Preliminaries; Elliptic Modular Curves as Riemann Surfaces) and Section 4 (Modular Functions and Modular Forms), especially Definition 4.5.. Checked 2026-10-16.

Suggest an edit · Report a correction

Original introduction: CC BY-SA 4.0.

Enter at the first unfamiliar stage. Follow a branch that matches your goal, and use the preparation checks only when you need a review.

1. Foundation: arithmetic and proof

Work with divisibility, congruences and reciprocity examples.

2. Algebraic branch

Move through fields and ideals toward local and global arithmetic.

3. Analytic branch

This branch runs in parallel with algebraic number theory; it need not follow it.

4. Connecting branch: modular forms

Use the relevant algebraic or analytic preparation; choose arithmetic geometry only after adding its geometric prerequisites.

Browse the library by subject cards · Search all resources