New Zealand Mathematical Olympiad Committee Camp Selection Problems 2011 Instructions

Solutions due date: 10 August 2011

These problems will be used by the NZMOC to select students for its International Mathematical Olympiad Training Camp. The camp will be held in Auckland between the 8th and 14th of January 2012. Only students who attend this camp are eligible for selection to represent New Zealand at the 2012 International Mathematical Olympiad (IMO), to be held in Argentina in July 2012. 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 2012 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). Note: Students in year 11 or below who have previously attended a January camp, but not been a member of the NZIMO training squad, are no longer required to do just the senior problems. 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 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 2012 and should also hold New Zealand Passports or have New Zealand Resident status. To be eligible for the 2012 IMO you must have been born on or after 20 July 1992, 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 Michael Albert, Department of Computer Science, University of Otago, PO Box 56, Dunedin 9054 arriving no later than 10 August 2011. You will be notied whether or not you have been selected for the Camp by 30 September 2011. If you have any questions, please contact Michael Albert (michael.albert@cs.otago.ac.nz, (03) 479 8586) or Chris Tuey (c.tuey@massey.ac.nz, (06) 356 9099 x3573). June 2011 www.mathsolympiad.org.nz

Registration Form NZMOC Camp Selection Problems 2011

Name: Gender: male/female School year level in 2011: 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? 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? Are there any criminal charges, or pending criminal charges against you? Some conditions are attached to camp selection. You must be: Born on or after 20 July 1992 Studying in 2012 at a recognised secondary school in NZ Available in July 2012 to represent NZ overseas as part of the NZIMO team if selected. A NZ citizen or hold NZ resident status. yes/no yes/no yes/no

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 Michael Albert, Department of Computer Science, University of Otago, PO Box 56, Dunedin 9054, arriving no later than 10 August 2011.

New Zealand Mathematical Olympiad Committee Camp Selection Problems 2011

Due: 10 August 2011

Junior division
J1. A three by three square is lled with positive integers. Each row contains three dierent integers, the sums of each row are all the same, and the products of each row are all dierent. What is the smallest possible value for the sum of each row? J2. Let an acute angled triangle ABC be given. Prove that the circles whose diameters are AB and AC have a point of intersection on BC. J3. There are 16 competitors in a tournament, all of whom have dierent playing strengths and in any match between two players the stronger player always wins. Show that it is possible to nd the strongest and second strongest players in 18 matches. J4. Find all pairs of positive integers m and n such that: (m + 1)! + (n + 1)! = m2 n2 . (Note: k! = 1 2 3 k.) J5. Let a square ABCD with sides of length 1 be given. A point X on BC is at distance d from C, and a point Y on CD is at distance d from C. The extensions of: AB and DX meet at P , AD and BY meet at Q, AX and DC meet at R, and AY and BC meet at S. If points P , Q, R and S are collinear, determine d. J6. Find all pairs of non-negative integers m and n that satisfy 3 2m + 1 = n2 .

Senior division
S1. Find all pairs of positive integers m and n such that m! + n! = mn . S2. In triangle ABC, the altitude from B is tangent to the circumcircle of ABC. Prove that the largest angle of the triangle is between 90 and 135 . If the altitudes from both B and from C are tangent to the circumcircle, then what are the angles of the triangle? S3. Chris and Michael play a game on a board which is a rhombus of side length n (a positive integer) consisting of two equilateral triangles, each of which has been divided into equilateral triangles of side length 1. Each has a single token, initially on the leftmost and rightmost squares of the board, called the home squares (the illustration shows the case n = 4).

A move consists of moving your token to an adjacent triangle (two triangles are adjacent only if they share a side). To win the game, you must either capture your opponents token (by moving to the triangle it occupies), or move on to your opponents home square. Supposing that Chris moves rst, which, if any, player has a winning strategy? S4. Let a point P inside a parallelogram ABCD be given such that AP B + CP D = 180 . Prove that AB AD = BP DP + AP CP (here AB, AD etc. refer to the lengths of the corresponding segments). S5. Prove that for any three distinct positive real numbers a, b and c: (a2 b2 )3 + (b2 c2 )3 + (c2 a2 )3 > 8abc. (a b)3 + (b c)3 + (c a)3 S6. Consider the set G of 20112 points (x, y) in the plane where x and y are both integers between 1 and 2011 inclusive. Let A be any subset of G containing at least 42011 2011 points. Show that there are at least 20112 parallelograms whose vertices lie in A and all of whose diagonals meet at a single point.