olymmath

USAJMO 2013

United States of America Junior Mathematical Olympiad 2013.

Day 1

Problem 2

  • Day 1

Each cell of an m×nm\times n board is filled with some nonnegative integer. Two numbers in the filling are said to be adjacent if their cells share a common side. (Note that two numbers in cells that share only a corner are not adjacent). The filling is called a garden if it satisfies the following two conditions:

(i) The difference between any two adjacent numbers is either 00 or 11 . (ii) If a number is less than or equal to all of its adjacent numbers, then it is equal to 00 .

Determine the number of distinct gardens in terms of mm and nn .

Answer, solutions and source

Problem 3 · Also USAMO 2013 Problem 1

  • Day 1

In triangle ABCABC , points PP , QQ , RR lie on sides BCBC , CACA , ABAB respectively. Let ωA\omega_A , ωB\omega_B , ωC\omega_C denote the circumcircles of triangles AQRAQR , BRPBRP , CPQCPQ , respectively. Given the fact that segment APAP intersects ωA\omega_A , ωB\omega_B , ωC\omega_C again at XX , YY , ZZ , respectively, prove that YX/XZ=BP/PCYX/XZ=BP/PC .

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Let f(n)f(n) be the number of ways to write nn as a sum of powers of 22 , where we keep track of the order of the summation. For example, f(4)=6f(4)=6 because 44 can be written as 44 , 2+22+2 , 2+1+12+1+1 , 1+2+11+2+1 , 1+1+21+1+2 , and 1+1+1+11+1+1+1 . Find the smallest nn greater than 20132013 for which f(n)f(n) is odd.

Answer, solutions and source

Problem 5

  • Day 2

Quadrilateral XABYXABY is inscribed in the semicircle ω\omega with diameter XYXY . Segments AYAY and BXBX meet at PP . Point ZZ is the foot of the perpendicular from PP to line XYXY . Point CC lies on ω\omega such that line XCXC is perpendicular to line AZAZ . Let QQ be the intersection of segments AYAY and XCXC . Prove that BYXP+CYXQ=AYAX.\dfrac{BY}{XP}+\dfrac{CY}{XQ}=\dfrac{AY}{AX}.

Answer, solutions and source

Problem 6 · Also USAMO 2013 Problem 4

  • Day 2

Find all real numbers x,y,z≥1x,y,z\geq 1 satisfying min⁡(x+xyz,y+xyz,z+xyz)=x−1+y−1+z−1.\min(\sqrt{x+xyz},\sqrt{y+xyz},\sqrt{z+xyz})=\sqrt{x-1}+\sqrt{y-1}+\sqrt{z-1}.

Answer, solutions and source