2018 Auckland Mathematical Olympiad QandAs
2018 Auckland Mathematical Olympiad QandAs
2018 Auckland Mathematical Olympiad QandAs
Questions
• Write all your working and solutions below the question.
• You are expected to show how you obtained your solution for each question, as correct
answers (without working) will be awarded 1 mark only.
• Markers will mark only one question at a time per candidate.
Junior Division
1. Find a multiple of 2018 whose decimal expansion's first four digits are 2017.
2. Starting with a list of three numbers, the “Make-My-Day” procedure creates a new
list by replacing each number by the sum of the other two.
For example, from {1, 3, 8} “Make-My-Day” gives {11, 9, 4} and a new “Make-
My-Day” leads to {13, 15, 20}.
If we begin with {20, 1, 8}, what is the maximum difference between two
numbers on the list after 2018 consecutive “Make-My-Day”s?
3. Consider the pentagon below. Find its area.
4. A vintage tram departs a stop with a certain number of boys and girls on board.
At the first stop, a third of the girls get out and their places are taken by boys.
At the next stop, a third of the boys get out and their places are taken by girls.
There are now two more girls than boys and as many boys as there originally were
girls.
How many boys and girls were there on board at the start?
6. For two non-zero real numbers a, b , the equation, 𝑎𝑎(𝑥𝑥 − 𝑎𝑎)2 + 𝑏𝑏(𝑥𝑥 − 𝑏𝑏)2 = 0
has a unique solution.
Prove that 𝑎𝑎 = ±𝑏𝑏 .
How many times does the digit 1 occur in its decimal representation?
10. There is a sequence of numbers +1 and -1 of length n. It is known that the sum
of every 10 neighbouring numbers in the sequence is 0 and that the sum of every
12 neighbouring numbers in the sequence is not zero.
What is the maximal value of n ?
2018 AUCKLAND MATHEMATICAL OLYMPIAD
Solutions for Students
2018
= 111 … 100000 + (11110 − 2018)
2014
= 111 … 100000 + 9092.
2014
Hence in decimal representation there are 2014 ones.
10 Firstly, let us show that n = 15 is possible. Indeed, we can have the sequence
+1 + 1 + 1 + 1 + 1 - 1 - 1 - 1 - 1 - 1 + 1 + 1 + 1 + 1 + 1:
Let us prove that n cannot be larger.
Suppose 𝑛𝑛 ≥ 16 and our sequence is 𝑥𝑥 = 𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 … 𝑥𝑥𝑛𝑛 .
Without loss of generality suppose 𝑥𝑥1 = 1.
Then, as the sum of every 10 neighbouring numbers is 0, we have 𝑥𝑥11 = 1.
Thus we have 𝑥𝑥 = 1𝑥𝑥2 𝑥𝑥3 … 𝑥𝑥10 1𝑥𝑥12 𝑥𝑥13 … 𝑥𝑥𝑛𝑛 .
We claim that 𝑥𝑥12 = … = 𝑥𝑥𝑛𝑛 = 1.
Indeed, among these, -1 cannot follow 1 since then we will have the sum of 12
consecutive terms of the sequence, which ends with these +1 and -1 being 0.
If 𝑛𝑛 ≥ 16, then we have at least 6 ones at the end of the sequence which it then makes
impossible to have the sum of the last 10 terms to be 0.