olymmath

EGMO 2016

European Girls' Mathematical Olympiad 2016.

Day 1

Problem 1

  • Day 1

Let nn be an odd positive integer, and let x1,x2,…,xnx_{1}, x_{2}, \ldots, x_{n} be non-negative real numbers. Show that

min⁡i=1,…,n(xi2+xi+12)≤max⁡j=1,…,n(2xjxj+1)\min _{i=1, \ldots, n}\left(x_{i}^{2}+x_{i+1}^{2}\right) \leq \max _{j=1, \ldots, n}\left(2 x_{j} x_{j+1}\right)

where xn+1=x1x_{n+1}=x_{1}.

Answer, solutions and source

Problem 2

  • Day 1

Let ABCDA B C D be a cyclic quadrilateral, and let diagonals ACA C and BDB D intersect at XX. Let C1,D1C_{1}, D_{1} and MM be the midpoints of segments CXC X, DXD X and CDC D, respectively. Lines AD1A D_{1} and BC1B C_{1} intersect at YY, and line MYM Y intersects diagonals ACA C and BDB D at different points EE and FF, respectively. Prove that line XYX Y is tangent to the circle through E,FE, F and XX.

Answer, solutions and source

Problem 3

  • Day 1
  • Answer

Let mm be a positive integer. Consider a 4m×4m4 m \times 4 m array of square unit cells. Two different cells are related to each other if they are in either the same row or in the same column. No cell is related to itself. Some cells are coloured blue, such that every cell is related to at least two blue cells. Determine the minimum number of blue cells.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Two circles, ω1\omega_{1} and ω2\omega_{2}, of equal radius intersect at different points X1X_{1} and X2X_{2}. Consider a circle ω\omega externally tangent to ω1\omega_{1} at a point T1T_{1}, and internally tangent to ω2\omega_{2} at a point T2T_{2}. Prove that lines X1T1X_{1} T_{1} and X2T2X_{2} T_{2} intersect at a point lying on ω\omega.

Answer, solutions and source

Problem 5

  • Day 2
  • Answer

Let kk and nn be integers such that k≥2k \geq 2 and k≤n≤2k−1k \leq n \leq 2 k-1. Place rectangular tiles, each of size 1×k1 \times k or k×1k \times 1, on an n×nn \times n chessboard so that each tile covers exactly kk cells, and no two tiles overlap. Do this until no further tile can be placed in this way. For each such kk and nn, determine the minimum number of tiles that such an arrangement may contain.

Answer, solutions and source

Problem 6

  • Day 2

Let SS be the set of all positive integers nn such that n4n^{4} has a divisor in the range n2+1,n2+2,…,n2+2nn^{2}+1, n^{2}+2, \ldots, n^{2}+2 n. Prove that there are infinitely many elements of SS of each of the forms 7m,7m+1,7m+2,7m+5,7m+67 m, 7 m+1,7 m+2,7 m+5,7 m+6 and no elements of SS of the form 7m+37 m+3 or 7m+47 m+4, where mm is an integer.

Answer, solutions and source