olymmath

USAMO 2000

United States of America Mathematical Olympiad 2000.

Day 1

Problem 1

  • Day 1

Call a real-valued function ff very convex if f(x)+f(y)2≥f(x+y2)+∣x−y∣\frac {f(x) + f(y)}{2} \ge f\left(\frac {x + y}{2}\right) + |x - y| holds for all real numbers xx and yy . Prove that no very convex function exists.

Answer, solutions and source

Problem 2

  • Day 1

Let SS be the set of all triangles ABCABC for which 5(1AP+1BQ+1CR)−3min⁡{AP,BQ,CR}=6r,5 \left( \dfrac{1}{AP} + \dfrac{1}{BQ} + \dfrac{1}{CR} \right) - \dfrac{3}{\min\{ AP, BQ, CR \}} = \dfrac{6}{r}, where rr is the inradius and P,Q,RP, Q, R are the points of tangency of the incircle with sides AB,BC,CA,AB, BC, CA, respectively. Prove that all triangles in SS are isosceles and similar to one another.

Answer, solutions and source

Problem 3

  • Day 1

A game of solitaire is played with RR red cards, WW white cards, and BB blue cards. A player plays all the cards one at a time. With each play he accumulates a penalty. If he plays a blue card, then he is charged a penalty which is the number of white cards still in his hand. If he plays a white card, then he is charged a penalty which is twice the number of red cards still in his hand. If he plays a red card, then he is charged a penalty which is three times the number of blue cards still in his hand. Find, as a function of R,W,R, W, and B,B, the minimal total penalty a player can amass and all the ways in which this minimum can be achieved.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Find the smallest positive integer nn such that if nn squares of a 1000×10001000 \times 1000 chessboard are colored, then there will exist three colored squares whose centers form a right triangle with sides parallel to the edges of the board.

Answer, solutions and source

Problem 5

  • Day 2

Let A1A2A3A_1A_2A_3 be a triangle and let ω1\omega_1 be a circle in its plane passing through A1A_1 and A2.A_2. Suppose there exist circles ω2,ω3,…,ω7\omega_2, \omega_3, \dots, \omega_7 such that for k=2,3,…,7,k = 2, 3, \dots, 7, ωk\omega_k is externally tangent to ωk−1\omega_{k-1} and passes through AkA_k and Ak+1,A_{k+1}, where An+3=AnA_{n+3} = A_{n} for all n≥1n \ge 1 . Prove that ω7=ω1.\omega_7 = \omega_1.

Answer, solutions and source