Mathematical Olympiad for Girls 2017

The whole Mathematical Olympiad for Girls 2017 paper, one question at a time in order (5 questions). Press Mark as done after each one: your marks add up below.

Whole paper 2020 2019 2018 2017 2016 2015

Questions and solutions © UK Mathematics Trust, shown with permission. Papers and more at ukmt.org.uk.

MOG

MOG 2017 Q1

1.

All the digits 1 to 9 are to be placed in the circles in Figure 1, one in each, so that the total of the numbers in any line of four circles is the same. In the example shown in Figure 2, the total is equal to 20.

Figure 1: nine empty circles arranged in a triangle with four circles on each side. Figure 2: the same triangle filled with 3 at the top, 8 and 9 below it, 4 and 1 below those, and 5, 2, 6, 7 along the bottom

Prove that if the total \(T\) is possible then the total \(40 - T\) is possible.

Mathematical Olympiad for Girls 2017, Question 1. © UK Mathematics Trust. Original paper on ukmt.org.uk

MOG 2017 Q2

2.

A positive integer is said to be jiggly if it has four digits, all non-zero, and no matter how you arrange those digits you always obtain a multiple of 12.

How many jiggly positive integers are there?

Mathematical Olympiad for Girls 2017, Question 2. © UK Mathematics Trust. Original paper on ukmt.org.uk

MOG 2017 Q3

MOGCurrent spec10 marksAlgebraGeometry & Angles
3.

Four different points \(A\), \(B\), \(C\) and \(D\) lie on the curve with equation \(y = x^2\).

Prove that \(ABCD\) is never a parallelogram.

Mathematical Olympiad for Girls 2017, Question 3. © UK Mathematics Trust. Original paper on ukmt.org.uk

MOG 2017 Q4

MOGCurrent spec10 marksAlgebraFactors, Primes & Digits
4.

Let \(n\) be an odd integer greater than 3 and let \(M = n^2 + 2n - 7\).

Prove that, for all such \(n\), at least four different positive integers (excluding 1 and \(M\)) divide \(M\) exactly.

Mathematical Olympiad for Girls 2017, Question 4. © UK Mathematics Trust. Original paper on ukmt.org.uk

MOG 2017 Q5

5.

Claire and Stuart play a game called Nifty Nines:

(i)

they take turns to choose one number at a time, with Claire choosing first;

(ii)

numbers can only be chosen from the integers 1 to 5 inclusive;

(iii)

the game ends when \(n\) numbers have been chosen (repetitions are permitted).

Stuart wins the game if the sum of the chosen numbers is a multiple of 9, otherwise Claire wins.

Find all values of \(n\) for which Claire can ensure a win, whatever Stuart’s choices were. You must prove that you have found them all.

Mathematical Olympiad for Girls 2017, Question 5. © UK Mathematics Trust. Original paper on ukmt.org.uk