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

Let pn(k)p_n(k) be the number of permutations of the set {1,,n}\{1, \ldots, n\}, n1n \geq 1, which have exactly kk fixed points. Prove that

k=0nkpn(k)=n!.\sum_{k=0}^{n} k \cdot p_n(k) = n!.

(Remark: A permutation ff of a set SS is a one-to-one mapping of SS onto itself. An element ii in SS is called a fixed point of the permutation ff if f(i)=if(i) = i.)

International Mathematical Olympiad 1987 Problem 3

Let x1,x2,,xnx_1, x_2, \ldots, x_n be real numbers satisfying x12+x22++xn2=1x_1^2 + x_2^2 + \cdots + x_n^2 = 1. Prove that for every integer k2k \geq 2 there are integers a1,a2,,ana_1, a_2, \ldots, a_n, not all 0, such that aik1|a_i| \leq k - 1 for all ii and

a1x1+a1x2++anxn(k1)nkn1.\left| a_1 x_1 + a_1 x_2 + \cdots + a_n x_n \right| \leq \frac{(k - 1) \sqrt{n}}{k^n - 1}.

International Mathematical Olympiad 1987 Problem 6

Let nn be an integer greater than or equal to 2. Prove that if k2+k+nk^2 + k + n is prime for all integers kk such that 0kn/30 \leq k \leq \sqrt{n/3}, then k2+k+nk^2 + k + n is prime for all integers kk such that 0kn20 \leq k \leq n - 2.