Olympiad-style combinatorics problems (ages 15 to 18)
22 original competition-style problems: counting arrangements, paths, subsets and tilings. Try each one before opening the hints; the second hint gives more away, and the full solution explains why the method works and where the idea leads.
Every question is free to read. The hints, answer checking and full solutions are included with every A Level, IB, IGCSE and CBSE plan. See plans.
For teachers: project, add to a worksheet or set as homework
Press Project on any problem to show it full screen with a timer, the hints, the answer and the worked solution one step at a time (arrow keys move between problems; Space reveals the next step; F full screen; Esc closes). Switch on the ‘Add to worksheet’ buttons, pick problems, then print them from the worksheet builder or set them as homework for a class, with the full solutions as the mark scheme. Free problems are free for every class; problems marked ‘With a plan’ can be set by teachers with a plan or school licence. Ready-made sessions: maths club packs.
The four cells of a 2 by 2 grid are each coloured with one of 3 colours. Two colourings count as the same if one can be rotated (by 90°, 180° or 270°) into the other. How many different colourings are there?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.
What is the smallest n such that every sequence of n different real numbers contains an increasing subsequence of length 4 or a decreasing subsequence of length 4?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.
How many arrangements of 1, 2, 3, 4, 5, 6 in a row have the property that every number (after the first) is either larger than all the numbers before it or smaller than all the numbers before it?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.
Five towns are to be connected by roads so that every town can reach every other, using exactly 4 roads (each road joins two towns directly). How many different road networks are possible?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.
What is the smallest n such that among any n points in the plane with whole-number coordinates, there are always two whose midpoint also has whole-number coordinates?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.
Six people sit around a round table. Arrangements that differ only by a rotation count as the same. In how many arrangements are Asha and Bilal not next to each other?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.
A convex polyhedron has only pentagonal and hexagonal faces, and exactly three faces meet at every vertex. It has 20 hexagonal faces. How many vertices does it have?
Hints, answer check and full worked solution. Included with every A Level, IB, IGCSE and CBSE plan.