Find a lesson & practise
Stuck on one question? You can work on its skill without finishing the whole paper.
Opens in a new tab. For guided practice, tap “Start with the basics” there, then return to this mock.
Return to the questionRMO Mock Paper 2 · IMOolympiad.com · Original practice
6 questions · 180 minutes · Written proofs
Move from finding an answer to explaining a complete argument. State your assumptions, justify the main step and account for every case.
Original independent practice. Use the suggested time for a full attempt; keep hints and solutions closed. Questions are not official RMO questions. No selection or score prediction is implied.
Question 1
For every nonnegative integer , determine explicitly in terms of divisibility conditions on .
Stuck on Question 1?Read lesson · Start practising
- Greatest common divisors and the Euclidean algorithmRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Unique prime factorisationRead lessonStart practising →Worked examples or 6 practice questions with hints.
Practice opens in a new tab. Tap “Start with the basics” there for a guided first question, then return here and retry Question 1.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 1Hint 1
Set and subtract the two expressions.
Hint 2
An odd common divisor must divide both t and 3; inspect powers of 2 separately.
Worked solution 1
Put . The gcd becomes . If an odd prime divides both numbers, it divides and hence 3; therefore only the odd prime 3 can occur. When , is divisible by 3 but not 9. When , it is not divisible by 3. If is even, is odd, so no factor 2 occurs. If is odd, has exactly one factor 2, and is even, so the gcd has exactly one factor 2. Thus the answer is . These factors are coprime, so the description is complete.
Answer / conclusion: Possible gcds 1,2,3,6, with the stated independent factors.
Review the idea: Greatest common divisor · Unique prime factorisation
Question 2
Find all positive integer pairs satisfying .
Stuck on Question 2?Read lesson · Start practising
- Symmetric polynomialsRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Factorisation and integer solutionsRead lessonStart practising →Worked examples or 6 practice questions with hints.
Practice opens in a new tab. Tap “Start with the basics” there for a guided first question, then return here and retry Question 2.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 2Hint 1
Set and .
Hint 2
Use , and the fact that .
Worked solution 2
The equation is symmetric in , and its right side contains their sum. This suggests setting and . The identity changes the equation into Because are positive integers, . Since , we have , so . Thus the integer satisfies .
Positivity gives another bound: Consequently which simplifies to , or . Among the integers from 2 to 9, the values 2 through 7 have , so their squares are at most 9. Only remain.
If , then , which lies strictly between and , so no integer works. If , then , giving or . Recover the original numbers using This gives or . Finally, , so both pairs satisfy the original equation.
Answer / conclusion: (3,6) and (6,3).
Review the idea: Symmetric polynomials · Factorisation integer solutions
Question 3
Triangle has , and . The internal bisector of meets at . The circle through meets the segment again at . Find , justifying that the second intersection lies inside the segment.
Stuck on Question 3?Read lesson · Start practising
- Parallel lines and angle bisectorsRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Circles, tangents and power of a pointRead lessonStart practising →Worked examples or 6 practice questions with hints.
Practice opens in a new tab. Tap “Start with the basics” there for a guided first question, then return here and retry Question 3.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 3Hint 1
Find CD using the angle-bisector theorem.
Hint 2
Compute the power of C using the secants CDB and CEA.
Worked solution 3
The angle-bisector theorem gives . Since , . The points and lie on the same ray from , so the power of is . The line already meets the circle at , with . Its other intersection therefore has directed distance along the same ray. Since , it is indeed on the interior of , distinct from . Hence , and .
Answer / conclusion: AE:EC = 8:7.
Review the idea: Parallel lines and angle bisectors · Circles and power of a point
Question 4
The integers are placed once each around a circle. For each position take the sum of that number and its next two neighbours clockwise. Determine the least possible value of the largest of these nine sums.
Stuck on Question 4?Read lesson · Start practising
- Counting without missing or repeating casesRead lessonStart practising →Worked examples or 6 practice questions with hints.
- How to write a proofRead lessonStart practising →Worked examples or 6 practice questions with hints.
Practice opens in a new tab. Tap “Start with the basics” there for a guided first question, then return here and retry Question 4.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 4Hint 1
The nine sums add to 135. If all were 15, compare neighbouring sums.
Hint 2
Try separating the larger numbers by smaller ones, and verify all nine wraparound sums.
Worked solution 4
Let the entries be , with indices reduced modulo 9. Each entry is included in three sums, so the nine sums total . If every sum were at most 15, all would be 15. Subtracting consecutive sums would give , contrary to distinctness. The largest sum is therefore at least 16.
This bound is attained by the clockwise order . Its nine clockwise sums are , all at most 16. Hence the required minimum is 16.
Answer / conclusion: 16; construction [1, 5, 8, 2, 6, 7, 3, 4, 9]
Review the idea: Counting · Proof methods
Question 5
For positive real numbers , put . Prove Determine when equality holds.
Stuck on Question 5?Read lesson · Start practising
- Sum of squaresRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Cauchy–Schwarz inequalityRead lessonStart practising →Worked examples or 6 practice questions with hints.
Practice opens in a new tab. Tap “Start with the basics” there for a guided first question, then return here and retry Question 5.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 5Hint 1
Write .
Hint 2
After expanding, the linear differences cancel. Each denominator is at most 2s.
Worked solution 5
We separate each fraction into a simple part and a nonnegative correction. Write , so . Squaring this identity and dividing by gives Make the same calculation with replaced by and then . Adding the three equations, the linear differences cancel because , while the first numerators add to . Hence the left side of the required inequality equals
Now , so . Taking reciprocals reverses this comparison; multiplying by the nonnegative square yields with equality exactly when . Similarly, and , giving the corresponding bounds for the other two fractions. Substituting them proves
If any difference is nonzero, its comparison is strict. Thus equality requires . Direct substitution shows that these values do give equality.
Answer / conclusion: Equality exactly at a=b=c.
Review the idea: Sum of squares · Cauchy schwarz inequality
Question 6
Prove that cannot be written as a product of two nonconstant polynomials with integer coefficients.
Stuck on Question 6?Read lesson · Start practising
- Irreducible polynomialsRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Remainder and factor theoremsRead lessonStart practising →Worked examples or 6 practice questions with hints.
Practice opens in a new tab. Tap “Start with the basics” there for a guided first question, then return here and retry Question 6.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 6Hint 1
At each of 0, 3, 6 and 9, an integer factor must have value 1 or −1.
Hint 2
Integer polynomial values at arguments whose difference is divisible by 3 are congruent modulo 3.
Worked solution 6
Suppose with nonconstant integer polynomials. Since , one factor, say , has degree at most 2. At each of , is 1, so has value either 1 or . All four arguments are congruent modulo 3, so the four values of are also congruent modulo 3. But 1 and are different residues modulo 3. Thus all four values equal one fixed sign . The polynomial , of degree at most 2, has four distinct roots; it is identically zero. Then is constant, a contradiction. Therefore no such factorisation exists.
Answer / conclusion: Irreducible as a product of nonconstant integer polynomials.
Review the idea: Irreducible polynomials · Remainder and factor theorems
After this paper
Record one idea you missed and one proof or calculation you want to improve. Work through the linked lesson, then try the next paper without hints.
Choose another RMO paper · Find a concept or theorem
Format reference: official RMO programme. Paper content is independently authored practice.