#CompetitionYearsProblemsYears
1International Mathematical Olympiad1959–2025398
2Middle European Mathematical Olympiad2009–2025160
International Mathematical Olympiad 2002 Problem 1

SS is the set of all (h,k)(h,k) with h,kh,k non-negative integers such that h+k<nh+k<n. Each element of SS is colored red or blue, so that if (h,k)(h,k) is red and hh,kkh'\leq h,k'\leq k, then (h,k)(h',k') is also red. A type 1 subset of SS has nn blue elements with different first member and a type 2 subset of SS has nn blue elements with different second member. Show that there are the same number of type 1 and type 2 subsets.

International Mathematical Olympiad 2002 Problem 4

The positive divisors of the integer n>1n>1 are d1<d2<<dkd_{1}<d_{2}<\ldots<d_{k}, so that d1=1,dk=nd_{1}=1,d_{k}=n. Let d=d1d2+d2d3++dk1dkd=d_{1}d_{2}+d_{2}d_{3}+\cdots+d_{k-1}d_{k}. Show that d<n2d<n^{2} and find all nn for which dd divides n2n^{2}.