Investigate integers through divisibility, residues and factorisation. Begin at the first unfamiliar idea; the prerequisite links help you find a shorter route. You can open any lesson.

Unsure where to start? Try the starting-point check.

  1. N01

    Divisibility of integers

    Use divisibility as a statement about an integer multiplier.

    Inside: Divisibility and integer multiples · Linear combinations · Parity and impossibility proofs

  2. N02

    Euclidean division and remainders

    Represent an integer with a valid bounded remainder.

    Inside: Quotient and remainder · Negative inputs · Uniqueness of the remainder

  3. N03

    Greatest common divisor and Bézout

    Use common divisors and linear combinations to explain the Euclidean algorithm.

    Inside: Euclidean algorithm · Bézout coefficients · Gcd and lcm · Coprimality arguments

  4. N04

    Prime numbers

    Prove compositeness or an infinitude claim using a clear contradiction or factorisation.

    Inside: Primality and composite numbers · Infinitely many primes · Constructing a factorisation · Sophie Germain identity

  5. N05

    Unique prime factorisation

    Use prime-exponent parity to justify perfect-power conclusions.

    Inside: Unique prime factorisation · Prime exponents · Squares, cubes and coprime products

  6. N06

    Counting and summing divisors

    Translate divisor questions into independent choices of prime exponents.

    Inside: Counting divisors by exponent choices · Sum and product of divisors · Perfect numbers

  7. N07

    Modular arithmetic and congruences

    Choose a useful modulus and justify cancellation or impossibility.

    Inside: Congruence notation · Operations and power cycles · Cancellation and inverses · Linear congruences · Modular obstructions

  8. N08

    Complete and reduced residue systems

    Use representatives without confusing them with the residue classes.

    Inside: Complete residue systems · Reduced residue systems · Multiplication permutes residues

  9. N09

    Number theory theorems: Fermat, Euler, Wilson and CRT

    Select a theorem from its hypotheses and explain when it is unavailable.

    Inside: Euler’s totient function · Fermat’s little theorem · Euler’s theorem · Wilson’s theorem · Chinese remainder theorem · Binomial coefficients and expansion in congruences · Digit sums in a base · Carmichael function and theorem (advanced)

  10. N10

    Number bases and digit problems

    Translate a digit string into a polynomial in the base.

    Inside: Place value in arbitrary bases · Base conversion · Digit constraints and divisibility

  11. N11

    Floor and ceiling functions

    Use the defining interval to control a floor expression.

    Inside: Floor, ceiling and fractional part · Floor identities and inequalities · Counting and factorial exponents

  12. N12

    Diophantine equations by factorisation

    Find all integer solutions and prove completeness.

    Inside: Linear Diophantine equations · Factorisation and complete factor pairs · Modular impossibility · Bounds and finite cases · Descent and harder equations

  13. N13

    Consecutive integer sums

    Turn a fixed total into factor pairs, use parity to find every positive consecutive sum, and prove how odd divisors count representations.

    Inside: Sum and average · Positive starts · Factor pairs · Odd divisors · Complete proofs

  14. N14

    Square Residues and Integer Equations

    Use square remainders, bounds and constructions to solve integer equations and distinguish a necessary condition from a complete proof.

    Inside: Residue tables · Obstructions · Bounds · Descent · Constructions

  15. N15

    Finite remainder cycles and repeated-digit numbers

    Derive append-digit and append-block remainder rules, distinguish eventual from pure cycles, and prove complete divisibility and existence statements.

    Inside: Append-digit rules · Tails and cycles · Repeated blocks · Complete divisibility proofs

  16. N16

    Prime exponents in factorials: trailing zeros and exact divisibility

    Count prime factors in a factorial, find trailing zeros and prove exact divisibility without expanding the product.

    Inside: Prime factor layers · Trailing zeros · Composite divisors · Inverse problems · Factorial quotients

  17. N17

    Square bounds and decimal prefixes: exact integer intervals

    Turn square-root prefixes into exact intervals, find every integer candidate, and justify the endpoints.

    Inside: Square bounds · Decimal prefixes · Strict endpoints · Integer counts · Complete proofs

  18. N18

    GCD constraints and coprime parametrisation

    Extract the common gcd, use coprime parameters, and prove that every allowed pair has been found.

    Inside: GCD scaling · Coprime cancellation · Complete parameter lists · Verification

  19. N19

    Nonnegative integer combinations: reachable totals and complete proofs

    Find complete nonnegative combinations, handle constraints and prove exact reachability thresholds.

    Inside: Feasibility · Remainder bounds · Complete lists · Sharp thresholds

These original lessons introduce the methods and give practice with solutions. A single short session is not a full assessment of Olympiad readiness. Build depth through the written challenges and your country’s official past papers.