IOQM Mock Paper 2 · IMOolympiad.com · Original practice
30 questions · 180 minutes · Integer answers from 00 to 99
Practise selecting a method, calculating exactly and recording a two-digit answer. Questions 1–10 carry 2 marks each, 11–20 carry 3 marks each, and 21–30 carry 5 marks each. There is no negative marking.
Original independent practice. Use the suggested time for a full attempt; keep hints and solutions closed. Questions are not official IOQM questions. No selection or score prediction is implied.
Question 1 · 2 marks
What is the least positive integer for which is a perfect square?
Compare prime exponents. Only the exponent of 2 is odd in 18. Since , a square multiple needs at least one further factor of 2. Taking gives 36, a square, so the least k is 2. Answer / conclusion: 02 Review the idea: Unique prime factorisationHint 1
Hint 2
Worked solution 1
Question 2 · 2 marks
Real numbers satisfy and . Find .
Expand the cube of the sum. Use . The identity gives , so . The pair confirms that the conditions are attainable. Answer / conclusion: 06 Review the idea: Algebraic identitiesHint 1
Hint 2
Worked solution 2
Question 3 · 2 marks
Each exterior angle of a regular convex polygon is . How many sides does it have?
The exterior angles make one complete turn. Divide 360 by 24. The exterior angles sum to . With n equal angles, , so . Answer / conclusion: 15 Review the idea: AnglesHint 1
Hint 2
Worked solution 3
Question 4 · 2 marks
A club has six members. How many different two-person teams can be formed?
The order of the two members does not matter. Count ordered selections, then divide by 2. There are ordered selections. Each team is counted twice, giving teams. Answer / conclusion: 15 Review the idea: Combinations and binomial coefficientsHint 1
Hint 2
Worked solution 4
Question 5 · 2 marks
Find the remainder when is divided by 11.
Pair residues with their multiplicative inverses. Only 1 and 10 are their own inverses modulo 11. Explicit inverse pairs modulo 11 are ; each pair has product 1 modulo 11. The remaining product is , so the remainder is 10. Answer / conclusion: 10 Review the idea: Number theory theoremsHint 1
Hint 2
Worked solution 5
Question 6 · 2 marks
A rhombus has diagonals of lengths 10 and 24. Find its perimeter.
The diagonals bisect each other at right angles. Each side is the hypotenuse of a triangle with legs 5 and 12. The diagonals of a rhombus bisect each other at right angles. To recall why: a rhombus is a parallelogram, so its diagonals bisect each other. The two triangles on either side of one half-diagonal have equal rhombus sides, equal halves of the other diagonal, and a common side. They are congruent, so their adjacent angles at the intersection are equal; those angles sum to , and therefore each is . A side is thus the hypotenuse of a right triangle with legs and . Its length is . All four sides are equal, giving perimeter . Answer / conclusion: 52 Review the idea: Quadrilaterals and their diagonalsHint 1
Hint 2
Worked solution 6
Question 7 · 2 marks
How many ordered pairs of integers satisfy ?
Separate points on the axes from the others. The positive magnitude pairs are and . The axis points are , giving 4. Each of the two magnitude pairs allows four sign choices, giving 8 more. The total is 12. Answer / conclusion: 12 Review the idea: Counting integer solutionsHint 1
Hint 2
Worked solution 7
Question 8 · 2 marks
How many three-digit positive integers have digit sum 2?
The hundreds digit is at least 1. Subtract 1 from that digit and distribute the remaining 1. Let the digits be , with . Then , whose three possibilities place the 1 in one of three positions. They give 200, 110 and 101. Answer / conclusion: 03 Review the idea: Number bases and digit problemsHint 1
Hint 2
Worked solution 8
Question 9 · 2 marks
Let for positive integers n. If , find n.
Expand the difference before substituting. It simplifies to .Hint 1
Hint 2
Question 10 · 2 marks
A rectangular box has edge lengths 4, 5 and 6. Find the square of its longest diagonal.
Use Pythagoras twice. The squared diagonal is the sum of the three squared edge lengths. Let be the diagonal of the rectangular face with side lengths 4 and 5. By Pythagoras, . Let be the space diagonal joining opposite vertices of the box. The edge of length 6 is perpendicular to the whole bottom plane, and hence to its diagonal . It forms a right triangle with legs and hypotenuse . Therefore A space diagonal uses all three perpendicular edge lengths and is longer than every face diagonal, so this is the requested square. Answer / conclusion: 77 Review the idea: Pythagoras and stewartHint 1
Hint 2
Worked solution 10
Question 11 · 3 marks
The three-digit number , where a is a digit, is divisible by 11. Find a.
Use the alternating sum test for 11. must be a multiple of 11. The alternating sum is . As , this lies from -2 to 7, whose only multiple of 11 is 0. Thus ; indeed . Answer / conclusion: 07 Review the idea: DivisibilityHint 1
Hint 2
Worked solution 11
Question 12 · 3 marks
How many distinct arrangements of the letters A, A, B, B, C have the two As separated by at least one other letter?
Count all arrangements, then those with AA as a block. Repeated Bs remain indistinguishable in both counts. There are total arrangements. With AA treated as one object, the objects AA, B, B, C have arrangements. The required count is . Answer / conclusion: 18 Review the idea: Permutations and arrangementsHint 1
Hint 2
Worked solution 12
Question 13 · 3 marks
When is divided by , the remainder is . Find .
Reduce powers using . Even powers contribute to the constant; odd powers contribute to x. Since , replacing by 1 does not change the remainder on division by : the removed part is a multiple of the divisor. Repeating this replacement gives remainder 1 for every even power and remainder for every odd power. Thus contributes 1, contributes , contributes 3, and the constant 4 remains 4. The remainder is . It already has degree below 2, as required. Hence , , and . Answer / conclusion: 06 Review the idea: Polynomial divisionHint 1
Hint 2
Worked solution 13
Question 14 · 3 marks
Triangle has , and . Find .
Use the cosine rule. . The cosine rule gives . Answer / conclusion: 57 Review the idea: Trigonometry in geometryHint 1
Hint 2
Worked solution 14
Question 15 · 3 marks
How many positive divisors d of 72 make odd?
The two summands must have opposite parity. All three factors of 2 must lie in one of the two summands. Write and . Opposite parity requires or ; for , both summands are even. There are two choices for a and three for b, so the answer is 6. Answer / conclusion: 06 Review the idea: Counting and summing divisorsHint 1
Hint 2
Worked solution 15
Question 16 · 3 marks
Find the least positive integer n for which .
Compute the first few powers modulo 13. Check that every smaller positive exponent fails. The first three powers have residues 3, 9 and 1, because . Neither of the first two is 1, so the least exponent is 3. Answer / conclusion: 03 Review the idea: RemaindersHint 1
Hint 2
Worked solution 16
Question 17 · 3 marks
How many four-element subsets of have an odd sum?
An odd sum uses an odd number of odd elements. There are five odd and four even numbers. The subset must contain either one odd and three even numbers, or three odd and one even number. These disjoint cases give . Answer / conclusion: 60 Review the idea: Combinations and binomial coefficientsHint 1
Hint 2
Worked solution 17
Question 18 · 3 marks
A convex quadrilateral has area 64. Its four side midpoints are joined in boundary order. Find the area of the resulting parallelogram.
Draw one diagonal of the original quadrilateral. The midpoint segments split the two triangles in fixed area ratios. Label the quadrilateral in boundary order, and let be the midpoints of , respectively. Write for the area of triangle . Each corner triangle cut off by a midpoint segment is similar to the triangle formed by that corner and its two neighbours, with length scale . Its area is therefore of the larger triangle’s area. The four corner areas consequently total Diagonal partitions the quadrilateral into triangles , whose areas sum to 64. Diagonal similarly gives . Thus the corners total , leaving area for the midpoint parallelogram. Answer / conclusion: 32 Review the idea: The midpoint theoremHint 1
Hint 2
Worked solution 18
Question 19 · 3 marks
Find , where is the greatest integer not exceeding t.
Group terms with equal floor values. The value 5 occurs only at k=20. The floor is 0 for k=1,2,3; each value 1,2,3,4 occurs four times; and 5 occurs once. The sum is . Answer / conclusion: 45 Review the idea: Floor and ceiling functionsHint 1
Hint 2
Worked solution 19
Question 20 · 3 marks
How many ordered triples of integers satisfy and ?
Count all nonnegative solutions and subtract violations. Two coordinates cannot both be at least 4. First ignore the upper bounds. Represent by six identical stars split into three groups by two separators; the group sizes are . Empty groups are allowed, including at the ends. Conversely every such arrangement gives exactly one nonnegative triple summing to 6. Choose the two separator positions among eight places: there are triples. If , put . Then , represented by two stars and two separators, so there are triples. The same count applies to a violation by or . Two violations cannot occur together, since they would make the sum at least . Subtracting the three disjoint forbidden cases leaves . Answer / conclusion: 10 Review the idea: Inclusion exclusion · Counting integer solutionsHint 1
Hint 2
Worked solution 20
Question 21 · 5 marks
How many integers n with satisfy ?
Treat divisibility by 4 and 5 separately. Modulo 4, n is 0 or 3; modulo 5, n is 0 or 4. Since consecutive integers have greatest common divisor 1, their product is divisible by 4 exactly when one of them is divisible by 4: its even member must supply both factors of 2. Thus or . Similarly, divisibility by 5 requires or . As 4 and 5 are coprime, both conditions together are equivalent to divisibility by 20. Among residues , the condition modulo 5 gives . Exactly also satisfy the condition modulo 4. Each of these four residues occurs five times from 1 to 100, so the answer is . Answer / conclusion: 20 Review the idea: Number theory theoremsHint 1
Hint 2
Worked solution 21
Question 22 · 5 marks
How many strings consisting of two As, two Bs and two Cs have the following property: in every initial segment, the number of As is at least the number of Bs, and the number of Bs is at least the number of Cs?
The first letter must be A. Branch on the second letter, which can only be A or B. If the first two letters are AA, the next letter must be B. Completing legally gives AABBCC or AABCBC. If the first two letters are AB, the third is A or C. A third A leaves one B and two Cs, giving ABABCC or ABACBC. A third C gives ABC, after which the remaining A,B,C are forced in that order. Thus ABCABC is the fifth string, and the branching exhausts all possibilities. Answer / conclusion: 05 Review the idea: CountingHint 1
Hint 2
Worked solution 22
Question 23 · 5 marks
How many monic quadratic polynomials with integer coefficients have two distinct positive integer roots and take the value 12 at ?
Write the polynomial as . The shifted roots satisfy . Order the two distinct roots as . Since the polynomial is monic, . Therefore Neither root can be 1, and both are positive integers, so both are at least 2. Thus form a positive unequal factor pair of 12. The possibilities are , giving root pairs . Each pair determines one monic polynomial with integer coefficients, and each has the required value at 1. Hence there are 3 polynomials. Answer / conclusion: 03 Review the idea: Vietas formulasHint 1
Hint 2
Worked solution 23
Question 24 · 5 marks
Two medians of a triangle have lengths 9 and 12 and lie on perpendicular lines. Find the length of the third median.
Let G be the centroid. It is two-thirds of the way from each vertex along its median. Choose , with G at the origin. Find the midpoint M of AB, then use . Let be the centroid, and let be the midpoint of , with the given medians drawn from . The centroid divides each median in the ratio from its vertex, so and . Their lines are perpendicular. Choose perpendicular coordinate axes through , directed towards and . Then , , and their midpoint is . Pythagoras gives . On the third median , the centroid property gives . Therefore the entire median has length . Answer / conclusion: 15 Review the idea: Concurrency and collinearityHint 1
Hint 2
Worked solution 24
Question 25 · 5 marks
Primes p and q satisfy . Find .
Assume p is the smaller prime. Then , leaving p=2,3,5. Interchanging the primes changes neither the equation nor their sum, so assume . Then , so and . The possible primes are 2, 3 and 5. Regard the equation as . Completing the square after multiplying by 4 gives Since is an integer, the right side must be a perfect square. For it is, respectively, 424, 409 and 361. The first two lie strictly between and , whereas . Thus , and positivity gives , so . Both are prime and . Hence . Answer / conclusion: 12 Review the idea: Prime numbersHint 1
Hint 2
Worked solution 25
Question 26 · 5 marks
How many noncongruent scalene triangles have positive integer side lengths and perimeter 18?
Order the sides . Triangle inequality gives . Order the distinct side lengths as ; this counts each noncongruent scalene triangle once. The triangle inequality gives , so and hence . If , the largest possible distinct sides would be 4, 5 and 6, whose sum is only 15. Thus . For , we need and , yielding only . For , we need with , giving or . Each pair has sum larger than , so all three triangles exist. They are , giving answer 3. Answer / conclusion: 03 Review the idea: Triangle inequalitiesHint 1
Hint 2
Worked solution 26
Question 27 · 5 marks
Six equally spaced positions on a circular necklace are coloured with exactly three black beads and three white beads. Two colourings are identified if one is a rotation of the other; reflections are not identified. How many colourings are there?
Count labelled strings and examine possible rotational periods. The only shorter period compatible with three black beads is period 2. There are colourings of six labelled positions. Define a colouring’s least rotational period as the smallest positive shift of positions that leaves it unchanged. It divides 6: write , . A shift by 6 and a shift by both preserve the colouring, so their difference, a shift by , does too. Minimality forces . Thus is 1, 2, 3 or 6. Period 1 would make every bead the same colour. Period 3 would repeat one three-bead block twice, giving an even number of black beads; both are impossible. Exactly two labelled colourings have period 2: the alternating patterns black-white-black-white-black-white and its shift. They form one rotation class. Every remaining colouring has period 6, meaning its six rotations are distinct. They form classes. Including the alternating class gives . Reflections have not been identified. Answer / conclusion: 04 Review the idea: Circular permutationsHint 1
Hint 2
Worked solution 27
Question 28 · 5 marks
How many ordered pairs of positive integers satisfy ?
Write , with a and b coprime. For each divisor d of 30, count coprime splits of . Put , and write , , where and . The equation becomes Set . Since , the possible divisors of 30 are ; larger divisors give . For fixed , choose ; then is forced. Also , because subtracting one number from the other does not change the common divisors. Thus we count the following eligible values. Each choice determines one ordered pair , and its greatest common divisor recovers , so none is counted twice. The total is . Answer / conclusion: 47 Review the idea: Greatest common divisorHint 1
Hint 2
Worked solution 28
m
Eligible a values
Count
29
1 through 28 (29 is prime)
28
14
1, 3, 5, 9, 11, 13
6
9
1, 2, 4, 5, 7, 8
6
5
1, 2, 3, 4
4
4
1, 3
2
2
1
1
Question 29 · 5 marks
Positive integers satisfy . What is the largest possible value of ?
Cauchy bounds the sum. Parity rules out the largest integer under that bound. Cauchy gives , so the integer sum is at most 12. But each integer has the same parity as its square, so the sum must be odd. Hence it is at most 11. The triple has squared sum 49 and sum 11, proving attainability. Answer / conclusion: 11 Review the idea: Cauchy schwarz inequalityHint 1
Hint 2
Worked solution 29
Question 30 · 5 marks
Point P lies strictly inside square , whose vertices are in boundary order. If , and , find the area of the square.
Put . Subtract the squared-distance equations and use x,y>0. Let the square side be . Choose , , , and . Since is strictly inside, . The three distance conditions give Subtracting the first equation from each of the other two yields and . Put , the square’s area. Then and . Substitute into and multiply by : Expanding gives , or . Since , we must have ; hence . This is attainable with , , , which lies inside the square and gives squared distances 5, 20 and 10. The area is 25. Answer / conclusion: 25 Review the idea: Pythagoras and stewartHint 1
Hint 2
Worked solution 30
Answers stay in this page session and are cleared by a reload. Checking is for self-practice; the answer key and solutions are available in this page.
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 IOQM paper · Find a concept or theorem
Format reference: official IOQM programme. Paper content is independently authored practice.