The official INMO 2021 question paper is on this page as a PDF from Homi Bhabha Centre for Science Education, with the original source linked beside it. The INMO exam covers every INMO from 2000 to 2026 except 2022. Download it below, then attempt the paper with a timer, following the steps on this page.
Explore: INMO hub · Syllabus & pattern · INMO 2023 · INMO 2020 · INMO 2019
Official HBCSE files
Every file is HBCSE’s own, from its past papers page.
At a glance
| Paper | Indian National Mathematical Olympiad 2021, 4 hours, maximum marks 102, all questions equal marks |
| Run by | HBCSE, for the National Board for Higher Mathematics |
| Password for the paper | PotterEvansVerres (as printed by HBCSE) |
| Files hosted | Question paper and official solutions |
About these files
HBCSE posted the INMO 2021 question paper as an encrypted PDF and prints its password next to the link: PotterEvansVerres. We host the file unchanged, so you need the same password to open it. The official solutions file is not protected, and its first problem matches the first problem of the paper.
| File | Type | Download |
|---|---|---|
| INMO 2021 question paper (password protected) | Question paper | |
| INMO 2021 official solutions | Solutions |
Paper structure
Once opened with the password, the question paper is a single page. It is headed only “MATHEMATICS, Time: 4 hours” and prints no date. Its instructions:
- Calculators in any form and protractors are not allowed. Rulers and compasses are allowed.
- All questions carry equal marks. Maximum marks: 102.
- No marks will be awarded for stating an answer without justification.
- Answer all the questions, and read the instructions on the answer booklet carefully.
The line about no marks for an unjustified answer is not on the 2017 and 2020 papers. It appears again on the 2023 and 2024 papers. The official solutions are eight pages, headed “INMO 2021 Official Solutions”.
The six problems
| No. | Area | What it asks |
|---|---|---|
| 1 | Number theory | 2r integers with mᵢnⱼ − mⱼnᵢ = ±1 for every pair i, j: find the largest possible r |
| 2 | Algebra (polynomials) | Find all integer pairs (a, b) for which both x³ + ax + b and x³ + bx + a have only integer roots |
| 3 | Combinatorial geometry | 2021 points, 1011 segment midpoints already marked: can the midpoint of any other segment be constructed with a straightedge alone? |
| 4 | Combinatorics (game) | A Detective asks whether two of 52 face-down cards are consecutive: prove she can force a win if and only if she may ask at least 50 questions |
| 5 | Geometry | A convex quadrilateral with angles 30°, 75°, 25° and CD = CB: extend CB to meet the circle through D, A, C again at E and prove CE = BD |
| 6 | Functional equation on polynomials | Find all maps f from real polynomials to real polynomials with f(0) = 0, a degree bound, and P − f(Q), Q − f(P) always having the same real roots |
How the official solutions argue
- Problem 1 shows that once two pairs are fixed, any third pair is determined up to sign. A fourth pair would give a determinant of ±2. So r = 3 is the maximum, attained by (1, 0), (1, 1), (0, 1). An alternate solution uses a parity argument.
- Problem 2 proves a lemma about three reals summing to 0 with absolute values at least 2. The only pair is (0, 0).
- Problem 3 answers “yes” through two lemmas on straightedge constructions with a marked midpoint. An alternate solution is also given.
- Problem 4 gives the Detective a strategy of comparing one card against all but one of the others. For the Magician’s side it turns to graph theory, looking at the longest cycle in a complete graph with edges removed.
- Problem 5 places a point F on AB with CF = CB and finds an equilateral triangle CDF. That leads to angle DEC = 30°.
- Problem 6 shows f(f(p)) = p, so f is a bijection. The answer is f(p) = p for all p, or f(p) = −p for all p.
How to practise with the 2021 paper
- Open the question paper with the password printed above and sit it for the full 4 hours. The solutions file is unprotected, so keep it closed until you finish.
- Problem 3 is a construction question and Problem 4 is a two-sided game. In each, write down what the other player or the restriction can do before you look for a strategy.
- Problem 1 needs both parts, an example with r = 3 and a proof that r = 4 fails.
- Problem 6 is a functional equation on polynomials, not on numbers. Try plugging f(p) into the conditions in place of q, as the official solution does, to see what that gives.
Other years
FAQ
What is the password for the INMO 2021 paper?
HBCSE prints it next to the link on its past papers page: PotterEvansVerres. The hosted file is HBCSE’s original, so the same password opens it.
How long was INMO 2021?
4 hours, as printed on the paper, for maximum marks 102.
Are the INMO 2021 solutions official?
Yes. HBCSE’s file is printed “INMO 2021 Official Solutions”.