Scribd
Upload
107 views

2012 Nzmoc

The document provides instructions for students attempting problems to be selected for New Zealand's International Mathematical Olympiad training camp and team. It gives details on eligibility, the problem sets, submission process and deadline of August 15th, 2012. Students completing the problems will be notified by October 7th if they have been selected for the January training camp.

Uploaded by

Joaquim Marques
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
107 views

2012 Nzmoc

The document provides instructions for students attempting problems to be selected for New Zealand's International Mathematical Olympiad training camp and team. It gives details on eligibility, the problem sets, submission process and deadline of August 15th, 2012. Students completing the problems will be notified by October 7th if they have been selected for the January training camp.

Uploaded by

Joaquim Marques
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/ 4

New Zealand Mathematical Olympiad Committee

Camp Selection Problems 2012 Instructions


Solutions due date: 15th August 2012
These problems will be used by the NZMOC to select students for its International Mathe-
matical Olympiad Training Camp, to be held in Auckland between the 6th and 12th of January
2013. Only students who attend this camp are eligible for selection to represent New Zealand
at the 2013 International Mathematical Olympiad (IMO), to be held in Colombia in July 2013.
The cost of the camp is yet to be determined precisely, but will not be more than $500.
At the camp a squad of 1012 students will be chosen for further training, and to take part
in several international competitions, including the Australian and Asia-Pacic Mathematical
Olympiads. The New Zealand team for the 2013 IMO will be chosen from this squad.
There are two sets of problems: junior division and senior division.
If you are currently in year 12, or you have been a member of the NZIMO training squad,
then you may only attempt the senior problems.
If you are currently in year 11 or below, and you have never been a member of the NZIMO
training squad, then you may attempt both sets of problems (and your results from both
sets will be taken into account in the selection process).
General instructions:
Although some problems seem to require only a numerical answer, in order to receive full
credit for the problem a complete justication must be provided. In fact, an answer alone
will only be worth 1 point out of 7.
You may not use a calculator, computer or the internet (except as a reference for e.g. def-
initions) to assist you in solving the problems.
All solutions must be entirely your own work.
We do not expect many, if any, perfect submissions. So, please submit all the solutions
and partial solutions that you can nd.
Students submitting solutions should be intending to remain in school in 2013 and should
also hold New Zealand Passports or have New Zealand Resident status. To be eligible for the
2013 IMO you must have been born on or after 12 July 1993, and must not be formally enrolled
in a University or similar institution prior to the IMO.
Your solutions, together with a completed Registration Form (overleaf), should be sent to
Dr Christopher Tuey, Institute of Fundamental Sciences, Massey University Man-
awatu, Palmerston North 4442
arriving no later than 15th August 2012. We regret that we are unable to accept electronic
submissions. You will be notied whether or not you have been selected for the Camp by 7th
October 2012.
If you have any questions, please contact Chris Tuey ([email protected], (06) 356 9099
x3573) or Michael Albert ([email protected]).
July 2012
www.mathsolympiad.org.nz
Registration Form
NZMOC Camp Selection Problems 2012
Name:
Gender: male/female
School year level in 2013:
Home address:
Email address:
Home phone number:
School:
School address:
Principal:
HOD Mathematics:
Do you intend to take part in the camp selection problems for any other
Olympiad camp?
yes/no
If so, and if selected, which camp would you prefer to attend?
Have you put your name forward for a Science camp or any other camp in
January?
yes/no
Are there any criminal charges, or pending criminal charges against you? yes/no
Some conditions are attached to camp selection. You must be:
Born on or after 12 July 1993
Studying in 2013 at a recognised secondary school in NZ
Available in July 2013 to represent NZ overseas as part of the NZIMO team if selected.
A NZ citizen or hold NZ resident status.
Declaration: I satisfy these requirements, have worked on the questions without assistance
from anyone else, and have read, understood and followed the instructions for the January
camp selection problems. I agree to being contacted through the email address I have supplied.
Signature: Date:
Attach this registration form to your solutions, and send them to
Dr Christopher Tuey, Institute of Fundamental Sciences, Massey University Man-
awatu, Palmerston North 4442,
arriving no later than 15th August 2012.
New Zealand Mathematical Olympiad Committee
Camp Selection Problems 2012
Due: 15 August 2012
Junior division
J1. From a square of side length 1, four identical triangles are removed, one at each corner,
leaving a regular octagon. What is the area of the octagon?
J2. Show the the sum of any three consecutive positive integers is a divisor of the sum of
their cubes.
J3. Find all triples of positive integers (x, y, z) with
xy
z
+
yz
x
+
zx
y
= 3
J4. A pair of numbers are twin primes if they dier by two, and both are prime. Prove that,
except for the pair {3, 5}, the sum of any pair of twin primes is a multiple of 12.
J5. Let ABCD be a quadrilateral in which every angle is smaller than 180

. If the bisectors
of angles DAB and DCB are parallel, prove that ADC = ABC.
J6. The vertices of a regular 2012-gon are labelled with the numbers 1 through 2012 in some
order. Call a vertex a peak if its label is larger than the label of its two neighbours, and
a valley if its label is smaller than the label of its two neighbours. Show that the total
number of peaks is equal to the total number of valleys.
Senior division
S1. Find all real numbers x such that
x
3
= {(x + 1)
3
}
where {y} denotes the fractional part of y, i.e. the dierence between y and the largest
integer less than or equal to y.
S2. Let ABCD be a trapezoid, with AB CD (the vertices are listed in cyclic order). The
diagonals of this trapezoid are perpendicular to one another and intersect at O. The base
angles DAB and CBA are both acute. A point M on the line sgement OA is such
that BMD = 90

, and a point N on the line segment OB is such that ANC = 90

.
Prove that triangles OMN and OBA are similar.
S3. Two courier companies oer services in the country of Old Aland. For any two towns,
at least one of the companies oers a direct link in both directions between them. Addi-
tionally, each company is willing to chain together deliveries (so if they oer a direct link
from A to B, and B to C, and C to D for instance, they will deliver from A to D.) Show
that at least one of the two companies must be able to deliver packages between any two
towns in Old Aland.
S4. Let p(x) be a polynomial with integer coecients, and let a, b and c be three distinct
integers. Show that it is not possible to have p(a) = b, p(b) = c, and p(c) = a.
S5. Chris and Michael play a game on a 5 5 board, initially containing some black and
white counters as shown below:
Chris begins by removing any black counter, and sliding a white counter from an adjacent
square onto the empty square. From that point on, the players take turns. Michael slides
a black counter onto an adjacent empty square, and Chris does the same with white
counters (no more counters are removed). If a player has no legal move, then he loses.
(a) Show that, even if Chris and Michael play cooperatively, the game will come to an
end.
(b) Which player has a winning strategy?
S6. Let a, b and c be positive integers such that a
b+c
= b
c
c. Prove that b is a divisor of c, and
that c is of the form d
b
for some positive integer d.

You might also like