What IOQM typically asks
- Permutations, combinations and careful casework.
- Inclusion-exclusion and complementary counting.
- Pigeonhole principle and parity arguments.
- Recurrences, paths and arrangements with restrictions.
- Probability and expected value in answer-based form.
The shortlist
| Book | Author | Stage | What it gives you |
|---|---|---|---|
| Introduction to Counting and Probability (AoPS) | David Patrick | Bridge | A friendly introduction to counting and probability |
| A Path to Combinatorics for Undergraduates | Andreescu, Feng | Core text | Counting strategies built up systematically |
| 102 Combinatorial Problems | Andreescu, Feng | Practice | Competition problems with solutions, by technique |
| Challenge and Thrill of Pre-College Mathematics | Krishnamurthy, Pranesachar, Ranganathan, Venkatachala | Indian style | Combinatorics chapters at RMO and IOQM level |
| Problem-Solving Strategies | Arthur Engel | Stretch | Pigeonhole, invariants and extremal principle with many problems |
Editions, reprints and availability in India vary, so check the table of contents of the edition you are buying against the topics you need.
Why school counting is not enough
School-level counting problems look similar to olympiad ones but ask for a different kind of careful, case-based reasoning. Without systematic practice, students rely on formulas and miss problems that need a structural argument.
How to study
- Work through one technique at a time, such as pigeonhole, and solve several problems using it.
- Always check small cases first. They reveal the pattern and verify your final answer.
- Write down which technique cracked each problem so you build a mental toolkit.
- Practise past IOQM combinatorics problems regularly to test transfer.
Because answers are numeric, double-check counts by a second method whenever time allows.

