Beruflich Dokumente
Kultur Dokumente
olympiads 1996-2011
Book 2 h lausch, A Di pasquale, DC hunt & PJ Taylor
Published by
E n r i c h m e n t S e r i e s
B oo k s in the Series
The Australian Mathematical Olympiad Problems for the first years were
published in a book with the same name but sub-headed “Book 1 1979 to
1995”. The Australian Mathematical Olympiad has continued its tradi-
tions in the following years and we now have enough to publish a second
book. During the time covered by this book, unlike the first book, there
have only been one Problems Committee Chairman and two Team Lead-
ers, and all three (Lausch, Hunt and Di Pasquale) have been available
to work through our materials and in fact improve them somewhat in
places. As a result we believe this book will be an accurate and useful re-
source for the student aspiring to develop their mathematical knowledge
in a systematic manner.
Whereas the procedures have been refined and improved during the past
16 years, because the event was already developed, there is not so much
history to tell. However we reproduce below the Preface from the recent
reprint of Book 1 because it does give useful background information.
Preface of Book 1
Even though it did not formally come into existence until 1980 the his-
tory of the Australian Mathematical Olympiad Committee (AMOC) re-
ally began in the 1970s. A number of mathematicians in Australia had
become aware of the growing strength of the International Mathematical
Olympiad, which had commenced in 1959 in Romania with six Eastern
Bloc countries taking part. The following extract comes from the first
Annual Report of AMOC:
“The possibility that Australia might take part in the International
Olympiad Programme had been under discussion informally in various
places for some years when an invitation to the 1979 Olympiad held in
London reached the Australian Government. Although this invitation
had to be declined because no procedures were available for selecting a
team and sending it to the Olympiad, its arrival did have the effect of
stimulating action which led to the formation of the Australian Mathe-
matical Olympiad Committee.
“Two particular consequences of the 1979 invitation should be men-
tioned. First, Mr JL Williams was able to arrange to attend the London
Olympiad as an observer and, with the assistance particularly of the
USA team under the leadership of Professor SL Greitzer, to observe the
proceedings at the Olympiad. On his return Mr Williams prepared a
very useful report which has been of great value to those involved in the
Olympiad movement.
vi Preface
either passed away (Peter O’Halloran and Jim Williams) or retired af-
ter a significant input to AMOC and were only able to dream of such a
result. The result is, nevertheless, a tribute to those pioneers.
HL, A DiP, DCH and PJT
December 2011
ACKNOWLEDGEMENTS
AND OBSERVATIONS
• preface vi i
• 1996 3
• 1997 14
• 1998 23
• 1999 33
• 2000 46
• 2 0 01 60
• 2002 78
• 2003 94
• 2004 11 3
• 2005 126
• 2006 139
• 2007 154
• 2008 166
• 2009 179
• 2 010 204
• 2 011 234
• GE N E RA L R EF ER EN C ES 256
1996
Problems
PAPER 1 Tuesday 06 February
p( 12 ) + p(− 12 )
= 1000.
p(0)
1 1 1
Find the value of + + .
r1r2 r2r3 r3 r1
|ak − k| = |a1 − 1| = 0
for k = 2, 3, . . ., n ?
4 1996
Prove that
2s
an − a1 ≥ .
n
7. For each positive integer n, let σ(n) denote the sum of all positive
integers that divide n. Let k be a positive integer and n1 < n2, . . .
be an infinite sequence of positive integers with the property that
σ(ni ) − ni = k for i = 1, 2, . . . . Prove that ni is a prime for
i = 1, 2, . . . .
8. Let f be a function that is defined for all integers and takes only
the values 0 and 1. Suppose f has the following properties:
(i) f(n + 1996) = f(n) for all integers n;
(ii) f(1) + f(2) + · · · + f(1996) = 45.
Prove that there exists an integer t such that f(n + t) = 0 for all n
for which f(n) = 1.
1996 5
Solution 1
.....
C
..................
........... .... .... .....
........... . .
B .......... ... ..... .....
............... .. ...
... ... ... .... ...
.. .... ..... ..
. ...
... ... .. ... ...
.... ...
..... .
.
...
...
... .. .... ...
... ... ... ...
... ..... ....
...
....
.... ....
... ....
...
.... ....
...
. D
. ... .
..
... ... ... .
. .
.
.
.... .... ... ..... ...
. .. ... .. ...
.............. ... ...
.......... ... .... .....
. . .
A ...........
.......... ..... .... .....
..................
......
E
We have
BEC = ECD since EBCD
= DEC since ED = DC
= ECA since ACED
= CAB since ABEC.
Solution 3
Alternative 1
Let tn be the nth term of the sequence with n = 1, 2, . . . .
Then we can see that t1 = 1 and tn+1 = tn + 6n for n = 1, 2, . . . . Hence
tn = 1 + 6(1 + 2 + · · · + (n − 1))
n(n − 1)
= 1+6×
2
= 3n2 − 3n + 1.
We first want to find all those values of n for which tn is a number ending
in 69. Algebraically it means that 3n2 − 3n + 1 − 69 is divisible by 100.
Hence 3n2 −3n+1−169 is divisible by 100 which implies that n2 −n−56
is divisible by 100 since 3 and 100 are relatively prime.
Thus we have to solve the quadratic equation
n2 − n − 56 = 100t,
where N is an integer.
Hence N 2 − 9 is divisible by 16. Clearly N is an odd number so there is
an integer K such that N = 2K + 1. Hence (2K + 1)2 − 9 is divisible by
16 which means that K 2 + K − 2 is divisible by 4.
Since K 2 + K − 2 = (K − 1)(K + 2), we see that either K − 1 or K + 2
is divisible by 4. This implies that K = 4M + 1 or K = 4M + 2 where
M is an integer.
Therefore N = 8M + 3 or N = 8M + 5.
Hence n = 20M + 8 or n = 20M + 13 where M = 0, 1, 2, 3, . . . .
Therefore the 69th member of the sequence 20M + 8, 20M + 13 where
M = 0, 1, 2, 3, . . . is 20 × 34 + 8 = 688, so that
t688 = 1 417 969
n 1 2 3 4 5 6 7 8 9 10 11 ...
6n 6 12 18 24 30 36 42 48 54 60 66
tn 1 7 19 37 61 91 127 169 217 271 331
We see that n must be ≡ 3 (mod 5).
n 3 8 13 18 23 28 33 . . .
tn 19 169 469 919 1519 1669 2569
The differences are 150, 300, 450, 600, . . ..
So tn ends in 69 iff n ≡ 8 or 13 mod 20. The 69th such number is tn
where n = 8 + 20 × 34 = 688 with
(a1 −1)+(a2 −2)+· · ·+(an −n) = (a1 +a2 +· · ·+an )−(1+2+· · ·+n) = 0.