olymmath

USAJMO 2014

United States of America Junior Mathematical Olympiad 2014.

Day 1

Problem 1

  • Day 1

Let aa , bb , cc be real numbers greater than or equal to 11 . Prove that min⁡(10a2−5a+1b2−5b+10,10b2−5b+1c2−5c+10,10c2−5c+1a2−5a+10)≤abc.\min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc.

Answer, solutions and source

Problem 2

  • Day 1

Let △ABC\triangle{ABC} be a non-equilateral, acute triangle with ∠A=60∘\angle A=60^\circ , and let OO and HH denote the circumcenter and orthocenter of △ABC\triangle{ABC} , respectively.

(a) Prove that line OHOH intersects both segments ABAB and ACAC .

(b) Line OHOH intersects segments ABAB and ACAC at PP and QQ , respectively. Denote by ss and tt the respective areas of triangle APQAPQ and quadrilateral BPQCBPQC . Determine the range of possible values for s/ts/t .

Answer, solutions and source

Problem 3 · Also USAMO 2014 Problem 2

  • Day 1

Let Z\mathbb{Z} be the set of integers. Find all functions f:Z→Zf : \mathbb{Z} \rightarrow \mathbb{Z} such that xf(2f(y)−x)+y2f(2x−f(y))=f(x)2x+f(yf(y))xf(2f(y)-x)+y^2f(2x-f(y))=\frac{f(x)^2}{x}+f(yf(y)) for all x,y∈Zx, y \in \mathbb{Z} with x≠0x \neq 0 .

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Let b≥2b\geq 2 be an integer, and let sb(n)s_b(n) denote the sum of the digits of nn when it is written in base bb . Show that there are infinitely many positive integers that cannot be represented in the form n+sb(n)n+s_b(n) , where nn is a positive integer.

Answer, solutions and source

Problem 5 · Also USAMO 2014 Problem 4

  • Day 2

Let kk be a positive integer. Two players AA and BB play a game on an infinite grid of regular hexagons. Initially all the grid cells are empty. Then the players alternately take turns with AA moving first. In his move, AA may choose two adjacent hexagons in the grid which are empty and place a counter in both of them. In his move, BB may choose any counter on the board and remove it. If at any time there are kk consecutive grid cells in a line all of which contain a counter, AA wins. Find the minimum value of kk for which AA cannot win in a finite number of moves, or prove that no such minimum value exists.

Answer, solutions and source

Problem 6

  • Day 2

Let ABCABC be a triangle with incenter II , incircle γ\gamma and circumcircle Γ\Gamma . Let M,N,PM,N,P be the midpoints of sides BC‾\overline{BC} , CA‾\overline{CA} , AB‾\overline{AB} and let E,FE,F be the tangency points of γ\gamma with CA‾\overline{CA} and AB‾\overline{AB} , respectively. Let U,VU,V be the intersections of line EFEF with line MNMN and line MPMP , respectively, and let XX be the midpoint of arc BACBAC of Γ\Gamma .

(a) Prove that II lies on ray CVCV .

(b) Prove that line XIXI bisects UV‾\overline{UV} .

Answer, solutions and source