Curriculum
Topics we teach — and have taught
These pages summarise how Exact Science structures olympiad-style mathematics: the core ideas, worked theory, and problem sets we have used in classes over the years. Many topics now also have interactive practice on Problems.cc.
Browse interactive lessonsMathematics
Olympiad techniques, number theory, combinatorics, and the habits of deliberate problem-solving.
Primary
Magic Square
This is a ‘magic’ square.Can you see what properties it has?All row totals, all column totals, two diagonal totals are all the same!Moreover, no number should be repeated.
Arithmetic Operations (Primary)
Math is more than numbers — it's about patterns, logic, and a little bit of creative play. This collection of arithmetic and bracket puzzles is designed to challenge young minds while keeping problem solving fun and engaging. From inserting the right operations between digits to rearranging numbers with clever use of brackets and basic arithmetic, these puzzles promote flexible thinking, mental calculation, and deeper mathematical understanding.
Opens on Problems.ccBalance scale puzzles
Weighing puzzles where each use of the scale must extract the most useful information.
Chessboard colouring
Colouring and parity arguments on a board that help students prove what is possible, and what is impossible, without checking every case.
Clock hours and minutes
Exploring angles between clock hands to connect turns, fractions of a circle, and careful measurement of time.
Colourings
Colouring boards, maps, and cubes to uncover patterns, parity, and invariants that survive every move.
Column arithmetic restoration
Restoring missing digits in written sums so place value, carrying, and careful checking become visible.
Combinatorics (Primary)
What is combinatorics? Combinatorics is the branch of mathematics that deals with counting — not just by listing, but by using smart rules and patterns to calculate the number of ways something can happen. We’ll explore questions like: • How many different outcomes are possible when making choices? • What’s the difference between arrangements (where order matters) and selections (where it doesn’t)? • How can we use multiplication, permutations, and combinations to solve these problems?
Magic squares
Number grids where rows, columns, and diagonals share a sum, revealing structure through careful filling.
Matchstick equations
False equations made of matchsticks that become true with a single carefully chosen move.
Matchstick problems
Shape puzzles where you move, add, or remove matchsticks to change a figure under clear rules.
Patterns
Opens on Problems.ccPatterns in numbers and digits
Sequence and digit puzzles that train children to hunt for rules, test them, and say clearly when a pattern holds.
River crossing riddles
Classic boat-and-bank puzzles where constraints force careful planning through a small state space.
Symmetry
Tower of Hanoi
The classic disk-and-peg puzzle that makes recursion, planning, and stepwise structure visible.
Water pouring puzzles
Measuring jug puzzles that turn filling, emptying, and pouring into a clear map of states and choices.
Junior
Ages
It is convenient to solve these problems through an equation. The main thing to remember is that the age difference always remains the same.
Opens on Problems.ccParity
You, of course, know that there are even and odd numbers.Even numbers are those that are divisible by 2 without a remainder (for example, 2, 4, 6, etc.). Each such number can be written as 2K by choosing a suitable integer K (for example, 4 = 2 x 2, 6 = 2 x 3, etc.).Odd numbers are those that, when divided by 2, leave a remainder of 1 (for example, 1, 3, 5, etc.). Each such number can be written as 2K + 1 by choosing a suitable integer K (for example, 3 = 2 x 1 + 1, 5 = 2 x 2 + 1, etc.).Even and odd numbers have remarkable properties:a) the sum of two even numbers is even;b) the sum of two odd numbers is even;c) the sum of even and odd numbers is odd number.
Worst Case Scenario
Racing
Opens on Problems.ccSums and averages
Opens on Problems.ccEquations
Opens on Problems.ccPigeonhole principle
Pigeonhole Principle (Dirichlet's principle) is a simple, intuitive, and often useful method for proving statements about a finite set. This principle is often used in discrete mathematics, where it establishes a connection between objects (“rabbits”) and containers (“cells”) when certain conditions are met.
Productivity
Opens on Problems.ccDivisibility
Opens on Problems.ccOlympiad BIDMAS
Opens on Problems.ccWeighing Puzzles
A balance puzzle or weighing puzzle is a logic puzzle about balancing items—often coins—to determine which holds a different value, by using balance scales a limited number of times. These differ from puzzles that assign weights to items, in that only the relative mass of these items is relevant.
Knights and Liars
There are two types of inhabitants on the Island of Knights and Liars. Knights always tell the truth. Liars always lie.
Opens on Problems.ccBase Numbers Problems
Opens on Problems.ccCryptarithms
Letter-digit puzzles in the SEND + MORE = MONEY tradition, where each letter stands for a digit under strict rules.
Double-lock cryptography
A story of two locks and shared secrets that makes commuting operations concrete for young mathematicians.
Exponents (Last Digit)
Explore deep-thinking maths problems involving last digits, powers, prime numbers, and digit tricks. Perfect for ages 11–16 and ideal for UKMT, AMC, and GCSE enrichment. Includes Olympiad-style theory with modular arithmetic, Diophantine equations, and factorial analysis.
Game theory and strategies
Simple two-player games where the real work is finding a strategy, not winning one lucky round.
Knight's tour
A chess knight visits every square of a board exactly once, turning a game move into a path problem.
Maximum non-attacking pieces
Chessboard placement problems that ask how many pieces can share a board without attacking each other, and why that number is best possible.
Number placement on graphs
Placing numbers on vertices or edges so sum and adjacency rules hold, turning constraints into clear reasoning.
Paths
Opens on Problems.ccRatio
Opens on Problems.ccIntermediate
Mathematics in Chess
A mathematical chess problem is a mathematical problem which is formulated using a chessboard and chess pieces. These problems belong to recreational mathematics. The most well-known problems of this kind are the eight queens puzzle and the knight's tour problem, which have connection to graph theory and combinatorics. Many famous mathematicians studied mathematical chess problems, such as, Thabit, Euler, Legendre and Gauss. Besides finding a solution to a particular problem, mathematicians are usually interested in counting the total number of possible solutions, finding solutions with certain properties, as well as generalization of the problems to N×N or M×N boards.
Opens on Problems.ccAM–GM Inequalities
The Arithmetic–Geometric Mean Inequality:If a ≥ 0, b ≥ 0, then(a + b)/2 ≥ √(ab) ≥ b.Equality holds if and only if a = b.
Opens on Problems.ccFlying rook
An unusual rook tour that asks students to plan a complete route under altered movement rules, with a clear Hamiltonian flavour.
GCD and LCM
In this lesson, we will work with the concepts of the greatest common divisor (GCD) and least common multiple (LCM), as well as related problem-solving techniques. The GCD of two numbers is the largest number that divides both of them without a remainder. The LCM of two numbers is the smallest number that is a multiple of both.
Number Theory
Remainders of Squares and Cubes
Triangle Inequality
In this lesson, we will use an important result known as the Triangle Inequality:|x| + |y| ≥ |x + y|
Senior
Extreme Principle
Induction Principle
The Induction Principle is of great importance in discrete mathematics: Number Theory, Graph Theory, Enumerative Combinatorics, Combinatorial Geometry, and other subjects. Usually one proves the validity of a relationship f(n) = g(n) if one has a guess from small values of n.
Opens on Problems.ccInvariant Principle
Maximum and Minimum
Method of Colouring
A colouring proof is a sort of invariant proof which can mainly be used to prove that something isn’t possible. The essence of invariant proofs is to strip the problem of any unnecessary details and only keep the information that best describes why something isn’t possible, making it very easy to follow invariant proofs.