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

Let nn and kk be given relatively prime natural numbers, k<nk < n. Each number in the set M={1,2,,n1}M = \{1, 2, \ldots, n-1\} is colored either blue or white. It is given that

  • (i) for each iMi \in M, both ii and nin-i have the same color;

  • (ii) for each iM,iki \in M, i \neq k, both ii and ik|i-k| have the same color.

Prove that all numbers in MM must have the same color.

International Mathematical Olympiad 1985 Problem 3

For any polynomial P(x)=a0+a1x++akxkP(x) = a_0 + a_1x + \cdots + a_kx^k with integer coefficients, the number of coefficients which are odd is denoted by w(P)w(P). For i=0,1,i = 0, 1, \ldots, let Qi(x)=(1+x)iQ_i(x) = (1+x)^i. Prove that if i1,i2,,ini_1, i_2, \ldots, i_n are integers such that 0i1<i2<<in0 \leq i_1 < i_2 < \cdots < i_n, then w(Qi1+Qi2++Qin)w(Qi1).w(Q_{i_1} + Q_{i_2} + \cdots + Q_{i_n}) \geq w(Q_{i_1}).

International Mathematical Olympiad 1985 Problem 6

For every real number x1x_1, construct the sequence x1,x2,x_1, x_2, \ldots by setting xn+1=xn(xn+1n) for each n1.x_{n+1} = x_n\left(x_n + \frac{1}{n}\right) \text{ for each } n \geq 1. Prove that there exists exactly one value of x1x_1 for which 0<xn<xn+1<10 < x_n < x_{n+1} < 1 for every nn.