OLIFORUM CONTEST

4TH EDITION

Problem 1. Given a prime p, consider integers 0 < a < b < c < d < p such that a4 , b4 , c4 and d4 give the same remainder when divided by p. Show that a + b + c + d divides a2013 + b2013 + c2013 + d2013 . (Proposed by Paolo Leonetti) Problem 2. Given a triangle ABC where all angles are acute, dene M the midpoint of AB , and P and Q the feets of heights from A to BC and from B to AC respectively. Show that if the line AC is tangent to the circumcircle of BM P then the line BC is tangent to the circumcircle of AM Q. (Proposed by Samuele Mongodi) Problem 3. Given a integer n greater than 1, suppose that x1 , . . . , xn are integers such that noone of them is divisible by n, and neither their sum. Prove that there exist at least n 1 non-empty subsets I {1, . . . , n} such that iI xi is divisible by n. (Proposed by Paolo Leonetti) Problem 4. Let p, q be integers such that the polynomial x2 + px + q + 1 has two positive integer roots. Show that p2 + q 2 is composite. (Proposed by Simone Di Marino) Problem 5. Let x, y, z be distinct positive integers such that (z + x)(z + y ) = (x + y )2 . Show that x2 + y 2 > 8(x + y ) + 2(xy + 1). (Proposed by Paolo Leonetti) Problem 6. Let P be a polyhedron whose faces are colored black and white so that there are more black faces and no two black faces are adjacent. Prove that P is not circumscribed about a sphere. (Proposed by Emanuele Tron) Problem 7. For every positive integer n, dene f (n) the number of non-empty subsets N {1, . . . , n} such that gcd(n N ) = 1. Show that f (n) is a square if and only if n = 1. (Proposed by Paolo Leonetti) Problem 8. Two distinct real numbers are written on each vertex of a convex 2012-gon. Show that we can remove a number from each vertex such that the remaining numbers on any two adjacent vertices are dierent. (Proposed by Paolo Leonetti)