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 questionMO Regionalrunde Klasse 9 Mock Paper 1 · IMOolympiad.com · Original practice
4 written-solution problems · 240 minutes for this practice paper
For school year 9. The 240-minute reference is the Lower Saxony organiser’s schedule for years 7–13. Your regional invitation takes precedence.
Original independent practice in English. Not an official paper or predicted selection test. Keep hints and solutions closed during your attempt.
How to review your proof
Check that you have used every condition, justified the main idea, covered all cases and stated the conclusion. A different complete proof can also be correct. This is a self-review checklist; written proofs are not automatically marked.
Question 1
Determine all ordered pairs of positive integers a,b satisfying .
Stuck on Question 1?Read lesson · Start practising
- 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 1.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 1Hint 1
The difference of the two variables is useful.
Hint 2
Put d=a−b; then their sum is d².
Worked solution 1
The equation is equivalent to . Set d=a−b, an integer. Then a+b=d², so adding and subtracting gives and . These are integers because neighbouring integers have even product. They are both positive exactly when d≥2 or d≤−2; d=−1,0,1 makes at least one zero. Conversely every stated d produces positive integers with difference d and sum d², hence satisfies the original equation. Equivalently, the answers are the pairs of neighbouring positive triangular numbers and their reversals.
Conclusion: a=d(d+1)/2, b=d(d−1)/2 for integer |d|≥2.
Review the idea: Factorisation integer solutions
Question 2
Positive real numbers a,b,c satisfy abc=1. Prove , and determine all equality cases.
Stuck on Question 2?Read lesson · Start practising
- Sum of squaresRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Algebraic identities and clever 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 2.
Skill practice supports your solution; proof questions still need written reasoning.
Back to Question 2Hint 1
Use abc=1 to turn ab,bc,ca into reciprocals.
Hint 2
Pair each ratio with its reciprocal.
Worked solution 2
Since abc=1, we have ab=1/c, bc=1/a and ca=1/b. Expanding the product gives For positive u,v, . Each bracket is therefore at least 2, proving the bound 9. Equality requires a=b=c; the product condition then makes all three equal to 1. That triple attains 9.
Conclusion: Equality exactly at a=b=c=1.
Review the idea: Sum of squares · Algebraic identities
Question 3
Eight labelled points occur in a fixed order around a circle. They are paired by four straight chords, with every point used exactly once. How many pairings have no crossing in the interior of the circle? Prove your count.
Stuck on Question 3?Read lesson · Start practising
- Counting with recurrencesRead 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
Look at the partner of one fixed point.
Hint 2
A chord splits the remaining points into two even-sized sets that can be paired independently.
Worked solution 3
Let count noncrossing pairings of 2n cyclically ordered points, with =1. Fix the first point. Its partner must be the 2k-th point for some k=1,…,n: otherwise one side contains an odd number of unused points, which cannot be paired without crossing that chord. The two sides contain 2(k−1) and 2(n−k) points; their pairings are independent, giving . This yields =1, =2, =5 and . Every pairing has one unique partner for the fixed point, so there is no double count.
Conclusion: 14 noncrossing pairings.
Review the idea: Counting with recurrences
Question 4
In triangle ABC, the medians from B and C lie on perpendicular lines. Prove .
Stuck on Question 4?Read lesson · Start practising
- Concurrency and collinearityRead lessonStart practising →Worked examples or 6 practice questions with hints.
- Pythagoras, medians and Stewart’s theoremRead 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
Place the centroid at the origin and the two median lines on coordinate axes.
Hint 2
The coordinates of the three vertices average to the centroid.
Worked solution 4
Let G be the centroid. Choose perpendicular coordinate axes along GB and GC, writing B=(p,0), C=(0,q), with p,q nonzero. Let D be the midpoint of BC, so D=(p/2,q/2). The centroid divides median AD in the ratio AG:GD=2:1, with A and D on opposite sides of G=(0,0). Thus the coordinates of A are −2 times those of D, namely A=(−p,−q). Pythagoras now gives , and . Adding the last two expressions gives exactly .
Conclusion: AB²+AC²=5BC².
Review the idea: Concurrency and collinearity · Pythagoras and stewart
After this paper
Choose one gap in your proof to repair, study the linked idea, and write a complete solution again before the next mock.
Choose another paper · Check your German selection route
Format reference: official organiser information. Questions and explanations are independent practice material.