olymmath

USAMO 1990

United States of America Mathematical Olympiad 1990.

Day 1

Problem 3

Show that for any odd positive integer we can always divide the set {n,n+1,n+2,…,n+32}\{\mathrm{n}, \mathrm{n}+1, \mathrm{n}+2, \ldots, \mathrm{n}+32\} into two parts, one with 14 numbers and one with 19 , so that the numbers in each part can be arranged in a circle, with each number relatively prime to its two neighbours. For example, for n=1\mathrm{n}=1, arranging the numbers as 1,2,3,…1,2,3, \ldots, 14 and 15,16,17,…,3315,16,17, \ldots, 33, does not work, because 15 and 33 are not relatively prime.

Answer, solutions and source

Day 2

Problem 4

How many positive integers can be written in base n\mathrm{n} so that (1) the integer has no two digits the same, and (2) each digit after the first differs by one from an earlier digit? For example, in base 3 , the possible numbers are 1,2,10,12,21,102,120,2101,2,10,12,21,102,120,210.

Answer, solutions and source