olymmath

USAMO 1994

United States of America Mathematical Olympiad 1994.

Day 1

Problem 1

a1,a2,a3,…a_{1}, a_{2}, a_{3}, \ldots are positive integers such that an>an−1+1a_{n}>a_{n-1}+1. Put bn=a1+a2+…+anb_{n}=a_{1}+a_{2}+\ldots+a_{n}. Show that there is always a square in the range bn,bn+1,bn+2,…,bn+1−1b_{n}, b_{n}+1, b_{n}+2, \ldots, b_{n+1}-1.

Answer, solutions and source

Problem 2

The sequence a1,a2,…,a99a_{1}, a_{2}, \ldots, a_{99} has a1=a3=a5=…=a97=1,a2=a4=a6=…=a98=2a_{1}=a_{3}=a_{5}=\ldots=a_{97}=1, a_{2}=a_{4}=a_{6}=\ldots=a_{98}=2, and a99=3a_{99}=3. We interpret subscripts greater than 99 by subtracting 99 , so that a100\mathbf{a}_{100} means a1\mathrm{a}_{1} etc. An allowed move is to change the value of any one of the ana_{n} to another member of {1,2,3}\{1,2,3\} different from its two neighbors, an−1a_{n-1} and an+1a_{n+1}. Is there a sequence of allowed moves which results in am=am+2=…=am+96=1,am+1=am+3=…=am+95=2\mathrm{a}_{\mathrm{m}}=\mathrm{a}_{\mathrm{m}+2}=\ldots=\mathrm{a}_{\mathrm{m}+96}=1, \mathrm{a}_{\mathrm{m}+1}=\mathrm{a}_{\mathrm{m}+3}=\ldots=\mathrm{a}_{\mathrm{m}+95}=2, am+97=3,an+98=2\mathrm{a}_{\mathrm{m}+97}=3, \mathrm{a}_{\mathrm{n}+98}=2 for some m\mathrm{m} ? [So if m=1\mathrm{m}=1, we have just interchanged the values of a98\mathrm{a}_{98} and a99\mathrm{a}_{99}.]

Answer, solutions and source

Problem 3

The hexagon ABCDEF\mathrm{ABCDEF} has the following properties: (1) its vertices lie on a circle; (2) AB=CD=EF\mathrm{AB}=\mathrm{CD}=\mathrm{EF}; and (3) the diagonals AD,BE,CF\mathrm{AD}, \mathrm{BE}, \mathrm{CF} meet at a point. Let X\mathrm{X} be the intersection of AD\mathrm{AD} and CE\mathrm{CE}. Show that CX/XE=\mathrm{CX} / \mathrm{XE}= (AC/CE)2(\mathrm{AC} / \mathrm{CE})^{2}.

Answer, solutions and source

Day 2

Problem 4

xi\mathrm{x}_{\mathrm{i}} is a infinite sequence of positive reals such that for all n,x1+x2+…+xn≥\mathrm{n}, \mathrm{x}_{1}+\mathrm{x}_{2}+\ldots+\mathrm{x}_{\mathrm{n}} \geq \sqrt{ }. Show that x12+x22+…+\mathrm{x}_{1}{ }^{2}+\mathrm{x}_{2}{ }^{2}+\ldots+ xn2>(1+1/2+1/3+…+1/n)/4\mathrm{x}_{\mathrm{n}}^{2}>(1+1 / 2+1 / 3+\ldots+1 / \mathrm{n}) / 4 for all n\mathrm{n}.

Answer, solutions and source

Problem 5

X\mathrm{X} is a set of n\mathrm{n} positive integers with sum s\mathrm{s} and product p\mathrm{p}. Show for any integer N>=s,Σ\mathrm{N}>=\mathrm{s}, \Sigma ( parity( Y\mathrm{Y} ) ( N−\mathrm{N}- sum(Y))Cs )=p)=\mathrm{p}, where aCb\mathrm{aCb} is the binomial coefficient a!/(b!(a−b)\mathrm{a}!/(\mathrm{b}!(\mathrm{a}-\mathrm{b}) ! ), the sum is taken over all subsets Y\mathrm{Y} of X\mathrm{X}, parity (Y)=1(\mathrm{Y})=1 if Y\mathrm{Y} is empty or has an even number of elements, -1 if Y\mathrm{Y} has an odd number of elements, and sum⁡(Y)\operatorname{sum}(\mathrm{Y}) is the sum of the elements in Y\mathrm{Y}.

Answer, solutions and source