100% found this document useful (1 vote)
827 views16 pages

2022 AIMO Paper and Solutions

Uploaded by

azar.20090209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
827 views16 pages

2022 AIMO Paper and Solutions

Uploaded by

azar.20090209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Thursday 8

September 2022
2022 Australian Intermediate Mathematics Olympiad - Questions
2022 Australian Intermediate Mathematics Olympiad

Questions
Time allowed: 4 hours. NO calculators are to be used.
Questions 1 to 8 only require their numerical answers all of which are non-negative integers less than 1000.
Questions 9 and 10 require written solutions which may include proofs.
The bonus marks for the Investigation in Question 10 may be used to determine prize winners.

1. A 3-digit number abc is multiplied by 3 to give the 4-digit number c0ba. Find the number abc. [2 marks]

2. A point D lies on the side AC of a triangle ABC. Triangle ADB is isosceles with DA = DB. Triangle DBC is
also isosceles with BC = BD. All angles in triangles ADB and DBC are an integer number of degrees. What is
the difference between the largest and smallest values that angle ADB could have? [2 marks]

3. Amy has 14 cousins aged 2, 3, 4, . . . , 15 respectively. She also has some cards separately numbered 16, 17, 18, . . . ,
k, for some integer k. Amy manages to give one card to each cousin so that the number on the card is a multiple
of that cousin’s age. Find the least k for which this is possible. [3 marks]


4. If 3x − 3−x = 285, what is 3x + 3−x ? [3 marks]

5. There are 5 lily pads on a pond, arranged in a circle. A frog can only jump from each lily pad to an adjacent lily
pad on either side. How many ways are there for the frog to start on one of these lily pads, make 11 jumps, and
end up where it started? [3 marks]

6. Find the sum of all (not necessarily distinct) values of a over all triples (a, b, c) of real numbers that satisfy the
equations:

(a + b)(c + 1) = 22 (1)
(a + c)(b + 1) = 22 (2)
(b + c)(a + 1) = 22 (3) [4 marks]

7. A triangle has sides of length x, y, 20 where x > y > 20 and x and y are integers. Let h be the length of the altitude
of the triangle from the side of length 20. Let hx and hy be the lengths of the altitudes from the sides of length x
and y respectively. These altitudes are such that h = hx + hy . Find the perimeter of this triangle. [4 marks]

8. A word is a sequence of zero or more letters taken from the set {A, B, C, D, E, F, G, H, I}. Two words are said
to be related if one can be obtained from the other by a sequence of the following operations:
(a) swapping two adjacent letters,
(b) deleting two adjacent letters which are the same,
(c) inserting two adjacent letters which are the same.
Thus, for instance, the words BACA and BCAA are related by swapping adjacent letters A and C, and BCAA is
related to BC by deleting or inserting two adjacent letter As. Note that the empty word with zero letters is related
to any word consisting of just two adjacent letters.
What is the maximum number of words in a set in which no word is related to any other? [4 marks]

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 51
Thursday 8
September 2022

n n
9. Find all positive integers n for which 99 + 9191 is divisible by 100. [5 marks]

10. Identical wind turbines are equally spaced in a straight line on level ground. Each turbine tower is a vertical
cylinder of radius 1 metre. Let L be the line through the base centres of the towers. There is an observer fixed at
O on the same level ground as the towers. Let A be the point on L that is closest to O.
If A is the base centre of a tower and OA = 15 metres, what is the maximum number of towers that are completely
visible to the observer over all possible distances d metres between the base centres of adjacent towers?
[5 marks]

Investigation
If OA = 16 metres and A is not the base centre of a tower, what is the maximum number of towers that are
completely visible to the observer? [4 bonus marks]

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 52
Thursday 8
September 2022

2022 Australian Intermediate Mathematics Olympiad - Solutions


Solutions
1. Method 1
When a 3-digit number is multiplied by 3, it cannot be larger than 2997. Hence c is either 1 or 2. It follows that
a = 3c as there would be no carry in the multiplication.
We have 3(100a + 10b + c) = 1000c + 10b + a. Substituting a = 3c gives 903c + 30b = 1003c + 10b which simplifies
to b = 5c. Since b < 10, the only solution is c = 1, b = 5, a = 3.
Therefore abc = 351.

Method 2
When a 3-digit number is multiplied by 3, it cannot be larger than 2997. Hence c is either 1 or 2. It follows that
a = 3c as there would be no carry in the multiplication.
The last digit of 3b is b. Hence b = 0 or 5.
If b = 0, we have 3 × abc = 3 × 301 = 903 ̸= 1003, or 3 × abc = 3 × 602 = 1806 ̸= 2006.
If b = 5, we have 3 × abc = 3 × 351 = 1053 = c0ba, or 3 × abc = 3 × 652 = 1956 ̸= 2056.
Therefore abc = 351.

Method 3
We have 3(100a + 10b + c) = 1000c + 10b + a
20b = 1000c − 3c + a − 300a
b = 50c − 15a + (a − 3c)/20
Since 1 ≤ a, c ≤ 9, we have −26 ≤ a − 3c ≤ 6, hence a − 3c = 0 or −20.
If a − 3c = −20, then b = 50c − 15(3c − 20) − 1 = 5c + 299 ≥ 304, which contradicts b ≤ 9.
If a − 3c = 0, then b = 50c − 45c = 5c. Since b and c are digits, c = 1, b = 5, and a = 3.
Therefore abc = 351.

2. Method 1
Let ̸ ADB = x◦ .

x◦
D

B C

Thus x < 180. Since ̸ BAD = 90 − x2 , x is even. So x ≤ 178.


Since ̸ CBD = 180 − 2(180 − x) = 2x − 180, 2x > 180. So x ≥ 92.
All angles are integers if x = 92 and all angles are integers if x = 178.
Hence the difference between the largest and smallest values of ̸ ADB is 178 − 92 = 86.

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 53
Thursday 8
September 2022

Method 2
Let ̸ BAD = y ◦ . Then we have

y◦

D
2y ◦
y◦
2y ◦
B C

Since ̸ CBD = 180 − 4y > 0, we have y < 45, hence 1 ≤ y ≤ 44.


So ̸ ADB = 180 − 2y ≥ 180 − 88 = 92 and ̸ ADB ≤ 180 − 2 = 178.
All angles are integers if ̸ ADB = 92 and all angles are integers if ̸ ADB = 178.
Hence the difference between the largest and smallest values of ̸ ADB is 178 − 92 = 86.

3. We want at least 14 composite numbers in the range 16 to k. The first 14 composites from 16 are 16, 18, 20, 21,
22, 24, 25, 26, 27, 28, 30, 32, 33, 34. Therefore k ≥ 34.
Working from m = 15 down to m = 2, the table shows all multiples of m that can be selected from the range above
and have not been selected for previous values of m.

m multiples m multiples m multiples m multiples


15 30 11 22, 33 7 21 3 27, 33
14 28 10 20 6 18 2 16, 22, 32, 34
13 26 9 18, 27 5 25
12 24 8 16, 32 4 16, 32

The only allowable multiple for 6 is 18, hence 27 for 9, 33 for 3, and 22 for 11. Choosing 16 as the multiple for 8,
leaves only 32 for 4, and 34 for 2. So we have 14 acceptable multiples:
30, 28, 26, 24, 22, 20, 27, 16, 21, 18, 25, 32, 33, 34.
Therefore the minimum value of k is 34.
Comment
Choosing 32 as the multiple for 8 gives the only other acceptable distribution from the 14 cards:
30, 28, 26, 24, 22, 20, 27, 32, 21, 18, 25, 16, 33, 34.

4. Method 1
Observe that 285 = (3x − 3−x )2 = 32x + 3−2x − 2.
Also (3x + 3−x )2 = 32x + 3−2x + 2 = 285 + 4 = 289.

Since 3x and 3−x are positive, we have 3x + 3−x = 289 = 17.

Method 2
Let 3x + 3−x = a. √ √
Adding 3x − 3−x = 285 gives 2 × 3x = a + 285.
√ √
Subtracting 3x − 3−x = 285 gives 2 × 3−x = a − 285.

Multiplying gives 4 = a2 − 285. Since a > 0, a = 289 = 17.

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 54
4
Thursday 8
September 2022

Method 3
√ √
Let t = 3x , then t − 1/t = 285, hence t2 − 285t − 1 = 0.
√ √
Since 3x > 0, we have t = 12 ( 285 + 285 + 4)
√ √
= 12 ( 285 + 289)

= 12 ( 285 + 17)

So 3x + 3−x = 12 ( 285 + 17) + √285+17
2

√ √
2( 285−17)
= 12 ( 285 + 17) + (√285+17)( √
285−17)
1
√ √
2( 285−17)
= 2 ( 285 + 17) + 285−172
√ √
= 12 ( 285 + 17) − 12 ( 285 − 17)
= 17
Method 4
√ √
Let t = 3x , then t − 1/t = 285, hence t2 − 285t − 1 = 0.
√ √ √ √ √
The roots of this quadratic are 12 ( 285 ± 285 + 4) = 12 ( 285 ± 289) = 12 ( 285 ± 17).
Since the product of these roots√is −1 (the constant
√ coefficient), the roots are t and −t−1 .
x −x −1 1 1
Hence 3 + 3 = t + t = 2 ( 285 + 17) − 2 ( 285 − 17) = 17.

5. Method 1
Suppose, in some order, the frog makes c clockwise jumps and 11 − c anticlockwise jumps. The net number of
anticlockwise jumps is 11 − 2c. Hence, the frog ends where it started if and only if 11 − 2c is divisible by 5. Since
0 ≤ c ≤ 11, the only values of c are 3 and 8.
Suppose the frog makes 3 clockwise and 8 anticlockwise jumps. Let k be the number of jumps between the first
and third clockwise jumps. For a given value of k = 1, 2, 3, . . . , 9, the first and third clockwise jumps could occupy
10 − k pairs of positions. For each of these positions, the second clockwise jump could occupy k positions. So the
number of ways the frog could make 3 clockwise and 8 anticlockwise jumps is

(9 × 1) + (8 × 2) + (7 × 3) + (6 × 4) + (5 × 5) + (4 × 6) + (3 × 7) + (2 × 8) + (1 × 9) = 165.

Similarly, the number of ways the frog could make 8 clockwise and 3 anticlockwise jumps is 165. So the number of
ways for the frog to make the 11 jumps is 165 + 165 = 330.
Comment
Alternatively, for students
  who are familiar with binomial coefficients, the number of ways exactly 311of
 the 11
jumps are clockwise is 113 = 165, and the number of ways exactly 8 of the 11 jumps are clockwise is 8 = 165.

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 55
Thursday 8
September 2022

Method 2
Label the lily pads A, B, C, D, E in rotational order as shown. Let an , bn , cn , dn , en be the number of ways the frog
can take n jumps from A to A, B, C, D, E, respectively. We may assume the frog starts at pad A. So the aim is to
find a11 .
A

B E

C D

As the frog may only jump from a given lily pad to an adjacent lily pad,

an = en−1 + bn−1
bn = an−1 + cn−1
cn = bn−1 + dn−1
dn = cn−1 + en−1
en = dn−1 + an−1 .

As the frog starts at A, by symmetry we have that bn = en and cn = dn . Therefore we need only consider just
three recursive equations an = 2bn−1 , bn = an−1 + cn−1 and cn = bn−1 + cn−1 , together with the initial condition
(a1 , b1 , c1 ) = (0, 1, 0).
From these we generate this table:

n 1 2 3 4 5 6 7 8 9 10 11
an 0 2 0 6 2 20 14 70 72 254 330
bn 1 0 3 1 10 7 35 36 127 167 474
cn 0 1 1 4 5 15 22 57 93 220 385

Thus a11 = 330.

Method 3
Label the lily pads A, B, C, D, E in rotational order. Represent each of the lily pads with a column of 12 circles
as shown. Draw a line connecting a circle in a row to a circle in the next row if the frog can jump from one
corresponding lily pad to the next in one step. We may assume the frog starts at C. A number k in a circle in row
n is the number of ways for the frog to reach the corresponding lily pad from C in n jumps.
All circles in row 0 have the number 0, the circles in row 1 have the numbers 0, 1, 0, 1, 0 respectively, and the
number in a circle in any other row is the sum of the numbers in the two adjacent circles in the previous row. We
want the number in circle C in row 11.

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 56
Thursday 8
September 2022

A B C D E

n=0 0 0 0 0 0

n=1 0 1 0 1 0

n=2 1 0 2 0 1

n=3 1 3 0 3 1

n=4 4 1 6 1 4

n=5 5 10 2 10 5

n=6 15 7 20 7 15

n=7 22 35 14 35 22

n=8 57 36 70 36 57

n=9 93 127 72 127 93

n = 10 220 167 254 167 220

n = 11 385 474 330 474 385

Thus the number of ways for the frog to take 11 jumps from C to C is 330.

6. Method 1
From (2) and (1) we have (a + b)(c + 1) = (a + c)(b + 1)
ac + a + bc + b = ab + a + bc + c
a(c − b) + (b − c) = 0
(a − 1)(c − b) = 0

From (3) and (1) we have (a + b)(c + 1) = (b + c)(a + 1)


ac + a + bc + b = ab + b + ac + c
a(b − 1) + c(1 − b) = 0
(b − 1)(a − c) = 0

So a = 1 or b = c, and b =The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
1 or a = c.
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.
If a = 1 and b = 1, then the original
© 2022 equations
Australian give Trust
Mathematics 2(c + 1) = 22, hence c = 10.
If a = 1 and a = c, then the original equations give 2(b + 1) = 22, hence b = 10.
Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 57
If b = c and b = 1, then the original equations give 2(a + 1) = 22, hence a = 10.
n = 10

n = 11 385 474 330 474 385 Thursday 8


September 2022
Thus the number of ways for the frog to take 11 jumps from C to C is 330.

6. Method 1
From (2) and (1) we have (a + b)(c + 1) = (a + c)(b + 1)
ac + a + bc + b = ab + a + bc + c
a(c − b) + (b − c) = 0
(a − 1)(c − b) = 0

From (3) and (1) we have (a + b)(c + 1) = (b + c)(a + 1)


ac + a + bc + b = ab + b + ac + c
a(b − 1) + c(1 − b) = 0
(b − 1)(a − c) = 0

So a = 1 or b = c, and b = 1 or a = c.
If a = 1 and b = 1, then the original equations give 2(c + 1) = 22, hence c = 10.
If a = 1 and a = c, then the original equations give 2(b + 1) = 22, hence b = 10.
If b = c and b = 1, then the original equations give 2(a + 1) = 22, hence a = 10.

If b = c and a = c, then the original equations give 2a(a + 1) = 22, hence a = − 21 ± 3
2 5.

Thus there are only 5 solutions for (a, b, c): 7


√ √ √
(1, 1, 10), (1, 10, 1), (10, 1, 1), (− 12 ± 3
2 5, − 12 ± 3
2 5, − 12 ± 3
2 5).
√ √
So the sum of all values of a is 1 + 1 + 10 + (− 12 + 3
2 5) + (− 12 − 3
2 5) = 11.

Method 2
From (2) and (1) we have (a + b)(c + 1) = (a + c)(b + 1)
ac + a + bc + b = ab + a + bc + c
a(c − b) + (b − c) = 0
(a − 1)(b − c) = 0 (4)

Since equations (1), (2), (3) are symmetric in a, b, c, we also have:

(b − 1)(a − c) = 0 (5)
(c − 1)(a − b) = 0 (6)

If no two of a, b, c are equal, then a = 1, b = 1, and c = 1, a contradiction.


If a = b ̸= c, then equation (4) gives a = 1. Then equation (1) gives 2(c + 1) = 22, hence c = 10.
So (a, b, c) = (1, 1, 10).
By symmetry, if a = c ̸= b, then (a, b, c) = (1, 10, 1), and if b = c ̸= a, then (a, b, c) = (10, 1, 1).

If a = b = c, then equation (1) gives a(a + 1) = 11, hence a = − 21 ± 32 5.
Thus there are only 5 solutions for (a, b, c):
√ √ √
(1, 1, 10), (1, 10, 1), (10, 1, 1), (− 12 ± 3
2 5, − 12 ± 3
2 5, − 12 ± 3
2 5).
√ √
So the sum of all values of a is 1 + 1 + 10 + (− 12 + 3
2 5) + (− 12 − 3
2 5) = 11.

1 1 1
7. The area of the triangle is 2 × 20 × h = 2 × x × hx = 2 × y × hy .

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics


h Olympiad Paper | 58
2 2
Thus there are only 5 solutions for (a, b, c):
√ √ √
(1, 1, 10), (1, 10, 1), (10, 1, 1), (− 12 ± 3
2 5, − 12 ± 3
2 5, − 12 ± 3
2
Thursday
5). 8
√ √ September 2022
So the sum of all values of a is 1 + 1 + 10 + (− 12 + 3
2 5) + (− 12 − 3
2 5) = 11.

1 1 1
7. The area of the triangle is 2 × 20 × h = 2 × x × hx = 2 × y × hy .

h
hy
hx y
20

1 1
Since h = hx + hy , we have 20 = x + y1 .

Method 1
20x 400
Hence y = x−20 = x−20 + 20. Therefore, x − 20 is a factor of 400.
20x

A triangle inequality gives 20 + > x, hence x2 − 60x + 400 < 0 and x < 10( 5 + 3) < 53.
x−20
20x

A triangle inequality gives x + 20 > x−20 , hence x2 − 20x − 400 > 0 and x > 10( 5 + 1) > 32.
So 12 < x − 20 < 33. Hence x − 20 = 16, 20, or 25.
Therefore x = 36, 40, or 45, with y = 45, 40, or 36 respectively.
Since x > y, we have x = 45, y = 36 and the perimeter is 20 + 36 + 45 = 101.

Method 2
1
From 20 = x1 + y1 we have (x − 20)(y − 20) = 400.
Thus x − 20 and y − 20 are cofactors of 400.

Since x > y, x − 20 > 400 = 20 and y − 20 < 20.
8
A triangle inequality gives x < 20 + y.
Thus 20 < x − 20 < y < 40.
So x − 20 = 25 and y − 20 = 16.
Hence x = 45, y = 36, and the perimeter is 45 + 36 + 20 = 101.

8. Method 1
A word that has its letters in alphabetical order and no repeated letter is called a standard word. Applying
operations (a) and (b) shows that any word relates to a standard word. We claim that two words are related if
and only if they relate to the same standard word.
First suppose that words X and Y relate to the same standard word S. Let Q denote a sequence of operations
(a) and (b) that converts Y to S. Let Q′ be the sequence Q with each operation (b) replaced with (c). Then the
sequence of operations that convert X to S followed by Q′ , converts X to Y . Thus X and Y are related.
Conversely, suppose two words X and Y are related. None of the operations (a), (b), (c) change the parity of the
number of times a letter L appears from one word to the next. So L appears an odd number of times in X if and
only if it appears an odd number of times in Y . Also, a standard form that relates to X has exactly those letters in
X that appear an odd number of times in X. The same applies to Y . Hence X and Y relate to the same standard
form.
So the claim is true. In particular no two standard words are related. Hence the maximum number of unrelated
words in a set is the number of standard words. We count the number of standard words by considering each of
the nine letters in turn: it may be either included or excluded. So the maximum number of unrelated words is
29 = 512.
The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
Method 2 and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

We show that two words X© 2022and Australian Mathematics Trust


Y are related if and only if, for each letter L, the parity of the number of times L
appears Contests
Mathematics in X is the
The same as the
Australian parity
Scene 2022of| Australian
the number of times Mathematics
Intermediate L appears in Y.
Olympiad Paper | 59

First suppose that X and Y are related. None of the operations (a), (b), (c) change the parity of the number of

Since x > y, x − 20 > 400 = 20 and y − 20 < 20.
A triangle inequality gives x < 20 + y.
Thus 20 < x − 20 < y < 40. Thursday 8
So x − 20 = 25 and y − 20 = 16. September 2022
Hence x = 45, y = 36, and the perimeter is 45 + 36 + 20 = 101.

8. Method 1
A word that has its letters in alphabetical order and no repeated letter is called a standard word. Applying
operations (a) and (b) shows that any word relates to a standard word. We claim that two words are related if
and only if they relate to the same standard word.
First suppose that words X and Y relate to the same standard word S. Let Q denote a sequence of operations
(a) and (b) that converts Y to S. Let Q′ be the sequence Q with each operation (b) replaced with (c). Then the
sequence of operations that convert X to S followed by Q′ , converts X to Y . Thus X and Y are related.
Conversely, suppose two words X and Y are related. None of the operations (a), (b), (c) change the parity of the
number of times a letter L appears from one word to the next. So L appears an odd number of times in X if and
only if it appears an odd number of times in Y . Also, a standard form that relates to X has exactly those letters in
X that appear an odd number of times in X. The same applies to Y . Hence X and Y relate to the same standard
form.
So the claim is true. In particular no two standard words are related. Hence the maximum number of unrelated
words in a set is the number of standard words. We count the number of standard words by considering each of
the nine letters in turn: it may be either included or excluded. So the maximum number of unrelated words is
29 = 512.

Method 2
We show that two words X and Y are related if and only if, for each letter L, the parity of the number of times L
appears in X is the same as the parity of the number of times L appears in Y .
First suppose that X and Y are related. None of the operations (a), (b), (c) change the parity of the number of
times L appears from one word to the next. So the parities of L agree.
Conversely, suppose the parities agree. Operation (b) decreases the number of times a letter appears by 2. Operation
(c) increases the number of times a letter appears by 2. So operations (a), (b), (c) can change X to a word that has
each letter appearing the same number of times that it does in Y , and then operation (a) can arrange the letters
so they are in the same order as in Y . So X and Y are related.
Define the signature of a word to be the binary sequence of 0s and 1s whose kth term has the same parity as the
parity of the number of times the kth letter in the sequence A, B, C, D, E, F, G, H, I appears in the word. So two
words relate if and only if they have the same signature. Hence the maximum number of unrelated words in a set
is the number of signatures. We count the number of signatures by considering each of the terms in turn: it may
be either 0 or 1. So the maximum number of unrelated words is 29 = 512.

9. Method 1
First observe that, modulo 100, we have:
91 = 9, 92 = 81, 93 ≡ 29, 94 ≡ 61, 95 ≡ 49, 96 ≡ 41, 97 ≡ 69, 98 ≡ 21, 99 ≡ 89, 910 ≡ 1
and
911 = 91, 912 = 81, 913 ≡ 71, 914 ≡ 61, 915 ≡ 51, 916 ≡ 41, 917 ≡ 31, 918 ≡ 21, 919 ≡ 11, 9110 ≡ 1.
Hence, for all integers k ≥ 0, we have:
910k ≡ 1, 910k+1 = 9, 910k+2 = 81, 910k+3 ≡ 29, 910k+4 ≡ 61,
910k+5 ≡ 49, 910k+6 ≡ 41, 910k+7 ≡ 69, 910k+8 ≡ 21, 910k+9 ≡ 89
and
9110k ≡ 1, 9110k+1 = 91, 9110k+2 = 81, 9110k+3 ≡ 71, 9110k+4 ≡ 61,
9110k+5 ≡ 51, 9110k+6 ≡ 41, 9110k+7 ≡ 31, 9110k+8 ≡ 21, 9110k+9 ≡ 11.
Thus, if n is even, then 9n and 91n are both congruent to 1 modulo 10, hence
n n
99 + 9191 ≡ 9 + 91 mod 100 ≡ 0 mod 100.

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 60
Thursday 8
September 2022

If n is odd, then 9n is congruent to 9 modulo 10 and 91n is congruent to 1 modulo 10, hence
n n
99 + 9191 ≡ 89 + 91 mod 100 = 80 mod 100.
n n
Thus 99 + 9191 is divisible by 100 if and only if n is even.

Method 2
We work modulo 100 throughout the following.
First observe that:
91 = 9, 92 = 81, 93 ≡ 29, 94 ≡ 61, 95 ≡ 49, 96 ≡ 41, 97 ≡ 69, 98 ≡ 21, 99 ≡ 89, 910 ≡ 1
and
911 = 91, 912 = 81, 913 ≡ 71, 914 ≡ 61, 915 ≡ 51, 916 ≡ 41, 917 ≡ 31, 918 ≡ 21, 919 ≡ 11, 9110 ≡ 1.
n 2 n−2 n−2 n−2 n−2 n−2
99 = (99 )9 = (981 )9 = (980 × 9)9 ≡ (1 × 9)9 = 99 .
0
n 99 = 9 if n is even
So 99 ≡ 1
99 ≡ 89 if n is odd
n 2 n−2 n−2 n−2 n−2 n−2
9191 = (9191 91
 ) 0 = (91
8281 91
) = (918280 × 91)91 ≡ (1 × 91)91 = 9191 .
n 9191 = 91 if n is even
So 9191 ≡ 1
9191 ≡ 91 if n is odd

n n 9 + 91 = 100 if n is even
Hence 99 + 9191 ≡
89 + 91 ≡ 80 if n is odd
n n
Thus 99 + 9191 is divisible by 100 if and only if n is even.

Method 3
We work modulo 100 throughout the following.
First observe that:
91 = 9, 92 = 81, 93 ≡ 29, 94 ≡ 61, 95 ≡ 49, 96 ≡ 41, 97 ≡ 69, 98 ≡ 21, 99 ≡ 89, 910 ≡ 1
and
911 = 91, 912 = 81, 913 ≡ 71, 914 ≡ 61, 915 ≡ 51, 916 ≡ 41, 917 ≡ 31, 918 ≡ 21, 919 ≡ 11, 9110 ≡ 1.
n n n n
99 + 9191 ≡ 99 + (−9)91
n n n
= 99 + (−1)91 991
n n
= 99 − 991
n n
−9n
= 99 (1 − 991 )

Now 9100q+r = (9100 )q × 9r ≡ 1q × 9r = 9r .


n
−9n
If n is even, then 91n − 9n ≡ 0, hence 991 ≡ 90 .
n n n
Therefore 99 + 9191 ≡ 99 (1 − 1) = 0.
If n is odd, then 91n − 9n is congruent to one of
91 − 9 = 82, 71 − 29 = 42, 51 − 49 = 2, 31 − 69 = −38 ≡ 62, 11 − 89 = −78 ≡ 22.
n n
Hence 991 −9 is congruent to one of 92 , 922 , 942 , 962 , 982 , all of which are congruent to 92 = 81.
n n n n
So 99 + 9191 ≡ 99 (1 − 81) ≡ 20 × 99 .
Now 9n is equivalent to one of 99 , 929 , 949 , 969 , 989 , all of which are congruent to 99 ≡ 89.
n n
Hence 99 + 9191 ≡ 20 × 89 = 1780 ≡ 80.
n n
Thus 99 + 9191 is divisible by 100 if and only if n is even.

Method 4
n n
We first show that 99 + 9191 is divisible by 4 for all positive integers n.
Modulo 4, 9k ≡ 1 and 91k ≡ 3 for all odd k.
n n
Since 9n and 91n are odd for all n, 99 + 9191 ≡ 1 + 3 ≡ 0 for all n.
n n
Next we show that 99 + 91
The91Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
is divisible by 25 if and only if n is even.
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.
Modulo 25, we have:
© 2022 Australian Mathematics Trust
91 = 9, 92 ≡ 6, 93 ≡ 4, 94 ≡ 11, 95 ≡ 24, 96 ≡ 16, 97 ≡ 19, 98 ≡ 21, 99 ≡ 14, 910 ≡ 1
and
Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 61
911 = 16, 912 = 6, 913 ≡ 21, 914 ≡ 11, 915 ≡ 1.
If n is odd, then 91 − 9 is congruent to one of
91 − 9 = 82, 71 − 29 = 42, 51 − 49 = 2, 31 − 69 = −38 ≡ 62, 11 − 89 = −78 ≡ 22.
n n
Hence 991 −9 is congruent to one of 92 , 922 , 942 , 962 , 982 , all of which are congruent to 92 = 81.
Thursday 8
n n n n
So 99 + 9191 ≡ 99 (1 − 81) ≡ 20 × 99 .
September
Now 9n is equivalent to one of 99 , 929 , 949 , 969 , 989 , all of which are congruent to 99 ≡ 89.
n n 2022
Hence 99 + 9191 ≡ 20 × 89 = 1780 ≡ 80.
n n
Thus 99 + 9191 is divisible by 100 if and only if n is even.

Method 4
n n
We first show that 99 + 9191 is divisible by 4 for all positive integers n.
Modulo 4, 9k ≡ 1 and 91k ≡ 3 for all odd k.
n n
Since 9n and 91n are odd for all n, 99 + 9191 ≡ 1 + 3 ≡ 0 for all n.
n n
Next we show that 99 + 9191 is divisible by 25 if and only if n is even.
Modulo 25, we have:
91 = 9, 92 ≡ 6, 93 ≡ 4, 94 ≡ 11, 95 ≡ 24, 96 ≡ 16, 97 ≡ 19, 98 ≡ 21, 99 ≡ 14, 910 ≡ 1
and
911 = 16, 912 = 6, 913 ≡ 21, 914 ≡ 11, 915 ≡ 1.
Hence 920 ≡ 1 ≡ 9120 mod 25.

Modulo 20, we have 91 = 9, 92 ≡ 1, and 911 = 11, 91210≡ 1.


Hence, for even n, we have:
n n
99 = 920r+1 = (920 )r × 9 ≡ 9 mod 25 and 9191 = 9120r+1 = (9120 )r × 91 ≡ 91 ≡ 16 mod 25.
n n
Hence 99 + 9191 ≡ 9 + 16 ≡ 0 mod 25.
For odd n, we have:
n n
99 = 920r+9 = (920 )r × 99 ≡ 14 mod 25 and 9191 = 9120r+11 = (9120 )r × 9111 ≡ 16 mod 25.
n n
Hence 99 + 9191 ≡ 14 + 16 ≡ 5 mod 25.
n n
Thus 99 + 9191 is divisible by 100 if and only if n is even.

10. Suppose a tower with centre C is completely visible to the observer but that tower obscures part of the next
tower away from O. By drawing lines through O tangential to the towers, we see that all towers from A to C are
completely visible from O but none of the towers to the right of C is visible. Number the tower centres from A to
C: 0, 1, 2, . . ., m. We first show that m ≤ 7.

Method 1
Line OZ is tangential at X to the (m − 1)th tower with centre B as shown. It intersects L at Y and CZ is
perpendicular to OZ.

(m − 1)d
Z
A B Y
• • • • • •
1 C
X

15


O

Triangles BXY and CY Z are similar, hence BY ≤ Y C. So 2BY ≤ BC = d.


Triangles BXY and OAY are similar, hence OY /15 = BY /1.
Since there is a tower centre at A, we have
AY = AB + BY = (m − 1)d + BY ≥ (2m − 1)BY = (2m − 1)OY /15.
Since AY /OY < 1, we have 15 > 2m − 1, hence m ≤ 7.

Method 2
Between the (m − 1)th tower, with centre
The Olympiad B,isand
program the mth
supported tower,
by the with
Australian centre C,Department
Government draw a line that isScience,
of Industry, tangential
Energyto
and Resources as
both towers at X and Z respectively through the Science
shown. Let O1Competitions:
be a pointMathematics and 15
on that line Informatics
metresOlympiads
from L. grant
Let opportunity.
A1 be the
point on L closest to O1 . Note
© 2022that O1 AMathematics
Australian 1 will be on the left of OA.
Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 62
(m − 1)d
O

Triangles BXY and CY Z are similar, hence BY ≤ Y C. So 2BY ≤ BC = d.


Triangles BXY and OAY are similar, hence OY /15 = BY /1. Thursday 8
Since there is a tower centre at A, we have September 2022
AY = AB + BY = (m − 1)d + BY ≥ (2m − 1)BY = (2m − 1)OY /15.
Since AY /OY < 1, we have 15 > 2m − 1, hence m ≤ 7.

Method 2
Between the (m − 1)th tower, with centre B, and the mth tower, with centre C, draw a line that is tangential to
both towers at X and Z respectively as shown. Let O1 be a point on that line 15 metres from L. Let A1 be the
point on L closest to O1 . Note that O1 A1 will be on the left of OA.

(m − 1)d
Z
A1 A B Y
• • • •
1 C
X

15 15


O1 O
Triangles BXY and CY Z are similar, hence BY = Y C. So 2BY = d.
Triangles BXY and O1 A1 Y are similar, hence A1 Y = 15XY and O1 Y = 15BY .

(m − 12 )d.
We have A1 Y ≥ AY = AB + BY = (m − 1)d + d/2 =11
So (m − 2 ) d ≤ A1 Y = 225XY = 225(BY − 1) = 225( 14 d2 − 1) < 225d2 /4.
1 2 2 2 2 2

Hence m < 15/2 + 1/2 = 8, so m ≤ 7.

Method 3
Between the (m − 1)th tower, with centre B, and the mth tower, with centre C, draw a line that is tangential to
both towers at X and Z respectively as shown. Let that line intersect OA at P .

(m − 1)d
Z
A B Y
• • • •
1 C
X

P

O

Triangles BXY and CY Z are similar, hence BY = Y C. So 2BY = d.


Triangles BXY and P AY are similar, hence AP = AY /XY .
So we have
AY (m − 1)d + d/2
15 ≥ = 
XY d2 /4 − 1

15 d2 − 4 ≥ 2(m − 1)d + d = (2m − 1)d

m ≤ (15 1 − 4/d2 + 1)/2

= 15 1/4 − 1/d2 + 1/2
< 15/2 + 1/2 = 8
The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.
Hence m ≤ 7.
© 2022 Australian Mathematics Trust
Next we show that m = 7 is possible by finding an acceptable value for d that allows the following configuration.
Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 63
6d d
P

Thursday 8
O September 2022

Triangles BXY and CY Z are similar, hence BY = Y C. So 2BY = d.


Triangles BXY and P AY are similar, hence AP = AY /XY .
So we have
AY (m − 1)d + d/2
15 ≥ = 
XY d2 /4 − 1

15 d2 − 4 ≥ 2(m − 1)d + d = (2m − 1)d

m ≤ (15 1 − 4/d2 + 1)/2

= 15 1/4 − 1/d2 + 1/2
< 15/2 + 1/2 = 8

Hence m ≤ 7.
Next we show that m = 7 is possible by finding an acceptable value for d that allows the following configuration.

6d d
Z
A B Y
• • •
1 C
X

15

As above, from similar triangles, d = 2BY and OY = 15BY . We have

OY 2 = OA2 + AY 2
225(d/2)2 = 225 + (13d/2)2
225d2 = 900 + 169d2

Since d > 2, it is possible to have m = 7. d2 = 900/56 > 4

Thus the maximum number of towers on the right of A and completely visible at O is 7. By symmetry, the
maximum number of towers on the left of A and completely visible at O is 7. Including the tower at A, the
maximum number of towers completely visible at O is 2 × 7 + 1 = 15.

12

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 64
Thursday 8
September 2022

Investigation
If there is no tower centre at A, let the distance between A and the closest tower centre on the right of A be αd
where 0 < α < 1. Suppose the observer can completely see exactly m towers to the right of A and m′ towers to
the left of A.

αd (m − 2)d
Z
A B Y
• • • •
1 C
X

16


O

As above, from similar triangles, d ≥ 2BY and OY = 16BY .


Now AY = αd + (m − 2)d + BY ≥ (2α + 2(m − 2) + 1)BY = (2α + 2m − 3)OY /16.
Since AY /OY < 1, we have m < 9.5 − α. Similarly m′ < 9.5 − (1 − α) = 8.5 + α.
If α = 1/2, then m ≤ 8 and m′ ≤ 8.
If α < 1/2, then m ≤ 9 and m′ ≤ 8.
If α > 1/2, then m ≤ 8 and m′ ≤ 9.
Next we show that these upper bounds on m are attainable by finding an acceptable value for d that allows the
following configurations.

αd 6d or 7d d
Z
A B Y
• • •
1 C
X

16

As above, from similar triangles, d = 2BY and OY = 16BY . We have

OY 2 = OA2 + AY 2
256(d/2)2 = 256 + d2 (α + (6 or 7) + 12 )2
256d2 = 1024 + d2 (2α + (13 or 15))2

With 1 > α ≥ 1/2, we have 256d2 = 1024 + d2 (2α + 13)2 . So d2 = 1024/(256 − (2α + 13)2 ).
With 0 < α < 1/2, we have 256d2 = 1024 + d2 (2α + 15)2 . So d2 = 1024/(256 − (2α + 15)2 ).
In each case there is a value for d > 2. So it is possible for m to attain its upper bounds. Similarly, the upper
bounds for m′ are attainable.
So the maximum number of completely visible towers is 8 + 8 = 16 if α = 1/2 and 8 + 9 = 17 if α ̸= 1/2.

The Olympiad program is supported by the Australian Government Department of Industry, Science, Energy
and Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2022 Australian Mathematics Trust

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Paper | 65
2022 Australian Intermediate Mathematics Olympiad
Statistics

Distribution of Awards/School Year

Number of Awards
Number of
Year
Students High
Prize Distinction Credit Participation
Distinction

8 476 2 19 40 125 290

9 539 6 51 53 172 257

10 493 16 71 83 153 170

Other 455 5 11 28 92 319

All Years 1963 29 152 204 542 1036

The award distribution is based on approximately the top 10% for High Distinction, next 15% for
Distinction and the following 25% for Credit.

Number of Correct Answers Questions 1–8

Number Correct / Question


Year
1 2 3 4 5 6 7 8

8 451 174 253 161 25 37 32 32

9 520 224 291 230 69 63 45 52

10 478 220 299 288 90 61 66 97

Other 430 109 202 110 29 41 21 26

All Years 1879 727 1045 789 213 202 164 207

Mean Score/Question/School Year

Question
Number of
School Year Overall Mean
Students
1–8 9 10

8 476 6.9 0.4 0.0 7.3

9 539 8.3 0.6 0.1 9.0

10 493 10.1 1.0 0.2 11.3

Other 455 6.0 0.3 0.0 6.4

All Years 1963 7.9 0.6 0.1 8.6

Mathematics Contests The Australian Scene 2022 | Australian Intermediate Mathematics Olympiad Statistics | 66

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy