Professional Documents
Culture Documents
Canada-National_Olympiad-2014-51
Canada-National_Olympiad-2014-51
National Olympiad
2014
1 Let a1 , a2 , . . . , an be positive real numbers whose product is 1. Show that the sum
a1 a2 a3 an
1+a1 + (1+a1 )(1+a2 ) + (1+a1 )(1+a2 )(1+a3 ) + ··· + (1+a1 )(1+a2 )···(1+an )
2n −1
is greater than or equal to 2n .
2 Let m and n be odd positive integers. Each square of an m by n board is coloured red or
blue. A row is said to be red-dominated if there are more red squares than blue squares in the
row. A column is said to be blue-dominated if there are more blue squares than red squares
in the column. Determine the maximum possible value of the number of red-dominated rows
plus the number of blue-dominated columns. Express your answer in terms of m and n.
4 The quadrilateral ABCD is inscribed in a circle. The point P lies in the interior of ABCD,
and ∠P AB = ∠P BC = ∠P CD = ∠P DA. The lines AD and BC meet at Q, and the
lines AB and CD meet at R. Prove that the lines P Q and P R form the same angle as the
diagonals of ABCD.
5 Fix positive integers n and k ≥ 2. A list of n integers is written in a row on a blackboard. You
can choose a contiguous block of integers, and I will either add 1 to all of them or subtract
1 from all of them. You can repeat this step as often as you like, possibly adapting your
selections based on what I do. Prove that after a finite number of steps, you can reach a state
where at least n − k + 2 of the numbers on the blackboard are all simultaneously divisible by
k.
This file was downloaded from the AoPS Math Olympiad Resources Page Page 1
http://www.artofproblemsolving.com/