olymmath

USAMO 2002

United States of America Mathematical Olympiad 2002.

Day 1

Problem 2

Let ABCABC be a triangle such that (cot⁡A2)2+(2cot⁡B2)2+(3cot⁡C2)2=(6s7r)2,\left( \cot \dfrac{A}{2} \right)^2 + \left( 2\cot \dfrac{B}{2} \right)^2 + \left( 3\cot \dfrac{C}{2} \right)^2 = \left( \dfrac{6s}{7r} \right)^2, where ss and rr denote its semiperimeter and its inradius, respectively. Prove that triangle ABCABC is similar to a triangle TT whose side lengths are all positive integers with no common divisors and determine these integers.

Answer, solutions and source

Day 2

Problem 5

Show that we can link any two integers m, n greater than 2 by a chain of positive integers m = a1a_1, a2a_2, ... , ak+1a_{k+1} = n, so that the product of any two consecutive members of the chain is divisible by their sum. [For example, 7, 42, 21, 28, 70, 30, 6, 3 links 7 and 3.]

Answer, solutions and source

Problem 6

I have an n×nn \times n sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let b(n)b(n) be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants cc and dd such that 17n2−cn≤b(n)≤15n2+dn\dfrac{1}{7} n^2 - cn \leq b(n) \leq \dfrac{1}{5} n^2 + dn for all n>0n > 0 .

Answer, solutions and source