Core IOQM topic hub
IOQM Number Theory: Learn Divisibility, Remainders and Integer Problems
Build Number Theory in a deliberate order—from divisibility and gcd to congruence and Diophantine equations—while learning the problem habits that turn facts into solutions.
It tests how well a student sees structure in integers: factors, gcd, primes, remainders, parity, digit patterns and equations restricted to whole numbers. The main difficulty is usually choosing the right representation—not performing long calculation.
Learning sequence
Study Number Theory in six connected layers
| Layer | Ideas | Problem habit |
|---|---|---|
| 1 · Integer language | Factors, multiples, parity, divisibility and prime factorisation | Rewrite conditions using divisibility notation |
| 2 · gcd and lcm | Euclidean algorithm, Bézout identity and factor exponents | Reduce large numbers before expanding |
| 3 · Remainders | Modular arithmetic, residue classes and cycles | Choose a modulus suggested by the question |
| 4 · Linear Diophantine equations | Integer solutions to ax + by = c | Check gcd divisibility before searching |
| 5 · Prime structure | Valuations, divisor counts and perfect powers | Compare prime exponents |
| 6 · Deeper tools | Fermat, Euler, Wilson, CRT and quadratic-residue ideas | Use a theorem only after checking its conditions |
Students should not jump to named theorems while divisibility and gcd reasoning is unstable. Advanced tools become shorter and safer when the earlier layers are automatic.
Foundation
Divisibility, gcd and prime factorisation
Divisibility turns verbal conditions into exact statements. If a number is divisible by 6, for example, ask what that implies about factors 2 and 3 and whether the converse needs coprimality. For gcd problems, the Euclidean algorithm is often more useful than full factorisation.
Prime factorisation is especially useful for divisor counts, lcm, perfect squares/cubes and valuations. Compare exponents prime by prime instead of treating a large integer as one object.
Remainder thinking
Modular arithmetic and cycles
Congruence records that two integers have the same remainder under a chosen modulus. It can compress powers, digit conditions and divisibility into a small finite set of cases.
Choose the modulus
Use 2 for parity, 4 or 8 for powers of 2, 3 or 9 for digit sums, 10 or 100 for last digits, or a divisor suggested by the equation.
Respect operations
Addition and multiplication behave cleanly modulo m. Division requires care: cancellation may fail unless the divisor is invertible modulo m.
Integer equations
Diophantine equations begin with existence
For ax + by = c, integer solutions exist exactly when gcd(a,b) divides c. This check should come before trial-and-error searching.
Olympiad problems often add positivity, bounds or divisibility conditions after the general solution. Apply those restrictions only after describing the integer family correctly.
Solution habits
Five questions to ask on an integer problem
- What are the parity and smallest possible residues?
- Can a gcd or prime-exponent comparison simplify the condition?
- Which modulus turns the expression into a short list?
- Does an integer solution exist before I try to find one?
- Can I factor a difference, sum or polynomial expression?
When a method fails, record why. A modulus may be too weak, factorisation may introduce impossible sign cases, or an argument may prove necessity without sufficiency.
Common errors
Number Theory mistakes that cost solutions
- Cancelling in modular arithmetic without checking invertibility.
- Assuming a number divisible by ab is automatically divisible by a and b in the needed direction without conditions.
- Using Fermat’s theorem when the base is not coprime to the modulus.
- Finding one Diophantine solution but not the full family.
- Ignoring negative or zero integer cases when the problem allows them.
- Treating a pattern from a few examples as a proof.
Practice progression
From topic sets to mixed IOQM questions
Stage 1
Short focused problems on divisibility, gcd and remainders with complete explanations.
Stage 2
Mixed Number Theory sets where the needed tool is not named.
Stage 3
Previous IOQM questions mixed with algebra or combinatorics so the domain boundary is less obvious.
References
Books and resources for the next level
The official HBCSE list includes Elementary Number Theory by David M. Burton and An Introduction to the Theory of Numbers by Niven, Zuckerman and Montgomery, along with broader Olympiad problem books. These are references for the wider pathway; select chapters by present level.
Questions answered
Frequently asked questions
Is Number Theory important for IOQM?
Yes. Divisibility, primes, remainders and integer equations are core parts of Mathematics Olympiad preparation and frequently connect with other domains.
Where should a beginner start?
Start with factors, multiples, parity, divisibility, prime factorisation and gcd before modular arithmetic and Diophantine equations.
Do I need Fermat and Euler theorems for IOQM?
They can be useful, but only after basic congruence and coprimality conditions are understood. Many IOQM problems can be solved with elementary remainder cycles.
What is a Diophantine equation?
It is an equation where integer solutions are required. For linear equations ax+by=c, gcd(a,b) must divide c.
How can I improve at remainder problems?
Practise choosing useful moduli, listing residue possibilities and checking whether cancellation or theorem conditions are valid.
Should I memorise divisibility tricks?
Use basic tests, but learn why they work and how to translate new digit conditions into modular arithmetic.
Which book is good for Number Theory?
The HBCSE list includes Burton and Niven–Zuckerman–Montgomery; choose by level and use a broad Olympiad problem book alongside.
How do I use previous papers for Number Theory?
Classify relevant questions, attempt them without topic labels, then identify the clue that should have suggested a Number Theory tool.
Next step
Learn the structure, then remove the topic label.
Study one layer, solve a focused set and then test recognition inside a mixed IOQM paper.
MENTOR PERSPECTIVE
“Number theory begins when ordinary integers start revealing unexpected structure.”Meet your IOQM mentor →