olymmath

USAMO 1988

United States of America Mathematical Olympiad 1988.

Day 1

Problem 1

The repeating decimal 0.ab…kpq…u=m/n0 . \mathrm{ab} \ldots \mathrm{kpq} \ldots \mathrm{u}=\mathrm{m} / \mathrm{n}, where m\mathrm{m} and n\mathrm{n} are relatively prime integers, and there is at least one decimal before the repeating part. Show that n\mathrm{n} is divisible by 2 or 5 (or both). [For example, 0.01136‾=0.01136363636…=1/880.011 \underline{36}=0.01136363636 \ldots=1 / 88 and 88 is divisible by 2.]

Answer, solutions and source

Problem 3

Let XX be the set {1,2,…,20}\{1,2, \ldots, 20\} and let P\mathrm{P} be the set of all 9-element subsets of X\mathrm{X}. Show that for any map f: P\mathrm{P} →X\rightarrow X we can find a 10 -element subset YY of XX, such that f(Y−{k})≠kf(Y-\{k\}) \neq k for any kk in YY.

Answer, solutions and source

Day 2

Problem 5

Let p(x)p(x) be the polynomial (1−x)a(1−x2)b(1−x3)c…(1−x32)k(1-x)^{a}\left(1-x^{2}\right)^{b}\left(1-x^{3}\right)^{c} \ldots\left(1-x^{32}\right)^{k}, where a,b,…,ka, b, \ldots, k are integers. When expanded in powers of xx, the coefficient of x1x^{1} is -2 and the coefficients of x2,x3,…,x32x^{2}, x^{3}, \ldots, x^{32} are all zero. Find k\mathrm{k}.

Answer, solutions and source