olymmath

USAMO 2013

United States of America Mathematical Olympiad 2013.

Day 1

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

Problem 2

  • Day 1

For a positive integer n≥3n\geq 3 plot nn equally spaced points around a circle. Label one of them AA , and place a marker at AA . One may move the marker forward in a clockwise direction to either the next point or the point after that. Hence there are a total of 2n2n distinct moves available; two from each point. Let ana_n count the number of ways to advance around the circle exactly twice, beginning and ending at AA , without repeating a move. Prove that an−1+an=2na_{n-1}+a_n=2^n for all n≥4n\geq 4 .

Answer, solutions and source

Problem 3

  • Day 1

Let nn be a positive integer. There are n(n+1)2\tfrac{n(n+1)}{2} marks, each with a black side and a white side, arranged into an equilateral triangle, with the biggest row containing nn marks. Initially, each mark has the black side up. An operation is to choose a line parallel to the sides of the triangle, and flipping all the marks on that line. A configuration is called admissible if it can be obtained from the initial configuration by performing a finite number of operations. For each admissible configuration CC , let f(C)f(C) denote the smallest number of operations required to obtain CC from the initial configuration. Find the maximum value of f(C)f(C) , where CC varies over all admissible configurations.

Answer, solutions and source

Day 2

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

Problem 5

  • Day 2

Given positive integers mm and nn , prove that there is a positive integer cc such that the numbers cmcm and cncn have the same number of occurrences of each non-zero digit when written in base ten.

Answer, solutions and source

Problem 6

  • Day 2

Let ABCABC be a triangle. Find all points PP on segment BCBC satisfying the following property: If XX and YY are the intersections of line PAPA with the common external tangent lines of the circumcircles of triangles PABPAB and PACPAC , then (PAXY)2+PB⋅PCAB⋅AC=1.\left(\frac{PA}{XY}\right)^2+\frac{PB\cdot PC}{AB\cdot AC}=1.

Answer, solutions and source