Number Theory Course Guide: Basic to Advanced
Number theory looks approachable because the questions are simple to state. The methods are not, and modular arithmetic is where most students stall.
A number theory course has an unusual problem: the subject looks approachable. Its questions can be stated with school arithmetic, which leads students to assume the methods will be equally familiar. They are not, and the gap between understanding a question and being able to start it is where most students stop.
Modular arithmetic is an algebraic system
This is the single most common blockage and it is worth naming first.
A student who first met "mod n" as a clock analogy can compute remainders and cannot reason with them. They do not know when they may divide both sides of a congruence, why that question even arises, or what makes a linear congruence unsolvable. So when Fermat's little theorem arrives, they can state it and cannot use it.
A proper number theory course teaches congruence as arithmetic in its own right from the beginning — with its own rules, its own failures, and its own structure. Everything from the Chinese Remainder Theorem onward depends on that foundation being real.
The basic stage
Divisibility, the division algorithm, gcd and lcm, the Euclidean algorithm and its extended form, Bezout's identity. Then primes, the fundamental theorem of arithmetic, Euclid's proof of the infinitude of primes, the sieve, divisor counting and summing functions.
Then the introduction to congruences: modular arithmetic as an algebraic system, residue classes, linear congruences and when they are solvable, and divisibility tests derived rather than memorised.
None of this is difficult in isolation. All of it needs to be automatic, because the intermediate stage assumes it costs no thought.
The working core
The Chinese Remainder Theorem is the standard move that turns one hard congruence into several easy ones, and it is the first result that feels genuinely powerful.
Fermat's little theorem, Euler's totient and theorem, and Wilson's theorem let a student compute enormous powers modulo n without computing the power, which is the first time number theory does something that looks impossible.
Orders and primitive roots is reliably the hardest unit and the most valuable. It is where a student has to hold several ideas simultaneously — the order of an element, its relationship to the group structure, and which moduli admit a primitive root at all.
It is also the unit that makes competition problems about exponents tractable. A student without it stares at a problem about the last digits of a tower of powers; a student with it knows exactly where to begin.
Arithmetic functions
Multiplicative functions, the divisor and sigma functions, the Mobius function and Mobius inversion, and Dirichlet convolution as the structure underneath.
This unit is where number theory starts to look like a subject with its own machinery rather than a collection of clever observations, and students who enjoy structure usually find it the most satisfying part of the intermediate stage.
Deciding solvability without solving
Quadratic reciprocity is where the subject starts to feel deeper than clever manipulation.
Quadratic residues, the Legendre symbol and Euler's criterion let you decide whether a quadratic congruence has a solution without producing one, and reciprocity turns that decision into a short computation. Gauss's lemma, the supplementary laws and the Jacobi symbol complete the picture.
Students find this genuinely surprising the first time, which is a good sign: it means they have understood what is being claimed.
Diophantine equations and advanced technique
Linear Diophantine equations, Pythagorean triples, Pell's equation and its continued-fraction solution, and descent arguments.
Then the p-adic valuation, Legendre's formula for the exponent of a prime in a factorial, and lifting the exponent — techniques that look technical and resolve problems that are otherwise intractable.
These appear throughout RMO and INMO and at the harder end of AMC 12 and AIME.
Proof, from the first week
Number theory is a proof subject. An answer without an argument earns very little in RMO, INMO, the Waterloo full-solution contests or any undergraduate examination, and the habit of writing one does not appear by itself.
Written work should be marked on whether a reader can follow it: assumptions stated, the awkward case handled rather than the convenient one, the conclusion actually reached. Most students find the first month uncomfortable. By about week six they are pre-empting the objections themselves.
That habit transfers directly to our combinatorics course and to the written-solution contests.
Why number theory is worth doing even without competitions
It is the subject where a student first meets mathematics that is proved rather than computed, and the proofs are short enough to follow completely.
A student who has worked through to quadratic reciprocity has done something qualitatively different from school mathematics: they have followed an argument that could not be checked by example, accepted it because the reasoning compels it, and then used it. That is what mathematics is, and number theory is the cheapest place to learn it.
How long each stage takes
A realistic frame helps, because number theory rewards steady work and punishes cramming.
The basic stage takes a term worked properly, and most of that time goes into making the Euclidean algorithm and congruence manipulation automatic rather than into new ideas. The intermediate stage — CRT through to arithmetic functions — takes two terms for most students, with orders and primitive roots alone deserving several weeks.
The advanced material is usually spread across a year alongside other work. Students who compress it find that quadratic reciprocity becomes a formula they can apply rather than a result they understand, which is a poor trade for the time saved.
Who this suits
Students from Class 9 upward through undergraduate study, with school algebra and no prior number theory. It suits students preparing for IOQM, RMO, AMC, the Integral Cup or any olympiad pathway, and equally students who want the subject for itself.
It pairs naturally with our algebra course, which supplies the manipulation every unit here assumes.
Questions people ask
Where does a number theory course start?
At divisibility, assuming only school algebra. No prior number theory is expected. The early material is worked until automatic rather than merely understood, because every later unit sits on it and a student who hesitates over gcd will not get far with primitive roots.
Why do students find modular arithmetic hard?
Usually because they met it as a clock analogy and never as an algebraic system. A student who thinks of mod n as the remainder can compute but cannot reason. Taught as arithmetic in its own right, with rules about what may and may not be divided, the later theorems become usable rather than quotable.
What is the hardest part?
Orders and primitive roots, consistently. It is the point where a student must hold several ideas at once, and it is also the unit that unlocks most competition problems involving exponents. It deserves proper time rather than rushing to quadratic reciprocity.
Is this an olympiad course?
It is the number theory olympiads draw on, taught as a subject rather than a list of competition tricks. Students preparing for IOQM, RMO, AMC or the Integral Cup use it, and so do students who simply want the subject.
Do you teach proofs?
Throughout, because number theory is a proof subject and an answer without an argument is worth very little in any serious examination. Written work is critiqued on whether a marker could follow it.
Get a study plan for this
Tell us the class and what they are working towards, and we will send a plan built around it, plus the next free trial class. No cost, and we will not pass your details on.
