Count without omissions or duplicates, then prove why the count works. Begin at the first unfamiliar idea; the prerequisite links help you find a shorter route. You can open any lesson.
- C01
Factorials
Explain the empty arrangement and simplify only valid factorial expressions.
Inside: Factorial notation and zero factorial · Cancelling factorial ratios
- C02
Basic counting principles
Define the counted object and choose disjoint cases or sequential choices.
Inside: Sum and product rules · Systematic casework · Complements and avoiding duplicates
- C03
Combinations and binomial coefficients
Distinguish a selection from an arrangement and justify the overcount factor.
Inside: Unordered selection · Pascal’s identity and symmetry · Restricted selection · Combinatorial identities
- C04
Counting with bijections
Prove a map is both one-to-one and onto.
Inside: Constructing a reversible correspondence · Counting through an easier model
- C05
Combinations with repetition
Count repeated selections with clearly stated object and box types.
Inside: Multisets · Stars and bars · Lower and upper bounds
- C06
Permutations and arrangements
Choose a representation that enforces the restriction without duplicate counting.
Inside: Distinct arrangements · Repeated symbols · Blocks, gaps and restrictions · Lexicographic reasoning
- C07
Circular permutations
Specify which configurations count as identical before dividing.
Inside: Rotations and a fixed reference · Reflections and necklace conventions
- C08
Dividing objects into fixed-size groups
Count partitions with correct group labels and size symmetries.
Inside: Labelled groups · Unlabelled groups · Equal group sizes and symmetry
- C09
Counting integer solutions
Convert a constrained sum into a counting model with valid bounds.
Inside: Nonnegative solutions · Positive and lower-bounded solutions · Upper bounds and cases
- C10
Binomial expansions and generating functions
Explain what each factor and exponent counts.
Inside: Binomial coefficients as choices · Multinomial expansion · Generating functions as choice records · Coefficient extraction
- C11
Counting with recurrences
Derive a recurrence from a disjoint partition of objects.
Inside: Conditioning on the last step · Tiling and string recurrences · Initial cases and verification
- C12
Inclusion–exclusion
Explain the alternating correction by tracking one object’s multiplicity.
Inside: Two and three sets · General inclusion-exclusion · Restricted counts
- C13
Derangements
Count permutations that avoid every original position.
Inside: No fixed points · Inclusion-exclusion derivation · Recurrence derivation
- C14
Objects and boxes
Choose the model from distinguishability and occupancy conditions.
Inside: Objects and boxes: the four models · Nonempty boxes · Capacity restrictions
- C15
Pigeonhole principle
Define useful boxes and justify why a collision forces the conclusion.
Inside: Basic pigeonhole · Generalised bounds · Choosing boxes · Remainder and geometry applications
- C16
Invariants and colouring
Find a property unchanged by every legal move, then use it to prove impossibility or compute a final value.
Inside: Parity invariants · Colouring and tiling · Remainders · Shifted products · Reachability proofs
- C17
The extremal principle
Choose a smallest, largest or best object, justify its existence, and use it to prove a claim or a sharp bound.
Inside: Largest and smallest choices · Equality propagation · Closest pairs · Optimal pairings · Extremal proofs
- C18
Lattice paths and blocked routes
Count restricted grid routes using checkpoints, blocked edges, disjoint cases and a last-step recurrence.
Inside: Step words · Checkpoints · Blocked edges · Last-step tables · Reflection proofs
- C19
Prefix sums and divisibility
Find and count consecutive blocks using boundary sums, remainders, parity and the pigeonhole principle.
Inside: Boundary sums · Remainder pairs · Block counting · Even lengths · Sharp bounds
- C20
Double counting: pairs and incidence
Count the same collection in two ways to solve membership, pairing and coloured-relationship problems.
Inside: Pairs · Incidence · Shared memberships · Colourings · Sharp bounds
- C21
One-stroke routes and parity
Use degree parity and connectivity to find endpoints, construct all-edge trails and prove minimum stroke counts.
Inside: Edges and vertices · Endpoint parity · Connectivity · Cycle insertion · Minimum strokes
- C22
Working backwards in integer transformations
Reverse legal integer moves, construct reachable targets and prove that a complete backward search terminates.
Inside: Inverse legality · Branching · Descent · Construction · Minimality
- C23
Nonadjacent selections: gaps and circular cases
Count nonadjacent selections on labelled rows and circles using reversible gap removal, case splits and exact boundary checks.
Inside: Gap removal · Labelled rows and circles · Restrictions · Bijection proofs
- C24
Greedy choices and exchange arguments
Test greedy choices with counterexamples and prove safe exchanges for scheduling, interval coverage and optimal pairings.
Inside: Counterexamples · Exchanges · Scheduling · Interval coverage · Optimality certificates
- C26
Subtraction games: winning positions and a strategy for every reply
Find winning and losing positions, choose a legal move and prove a strategy works against every reply.
Inside: Legal moves · Winning and losing positions · Remainder strategies · Changed move sets · Proofs
- C27
Logical deduction: exactly-one conditions and valid implications
Test every permitted case, count true statements, and justify valid implications and countermodels.
Inside: Truth tables · Exact truth counts · Valid implications · Witnesses · Countermodels
- C28
Weighted partial sums and changing averages
Count each entry’s contribution to running totals, track changes in their average, and prove comparisons and optimal orders.
Inside: Contribution counting · Changed entries · Reverse order · Exchange proofs
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.