uniolympiads Ελληνικά

IMC 1999

All the problems of the year on one page, as on the contest paper.

Official files

  1. Problem 1 (Day 1)

    a) Show that for any m∈Nm \in \mathbb{N} there exists a real m×mm \times m matrix AA such that A3=A+IA^3 = A + I, where II is the m×mm \times m identity matrix. (6 points)

    b) Show that det⁡A>0\det A > 0 for every real m×mm \times m matrix satisfying A3=A+IA^3 = A + I. (14 points)

    Hints and solution

  2. Problem 2 (Day 1)

    Does there exist a bijective map π ⁣:N→N\pi\colon \mathbb{N} \to \mathbb{N} such that

    ∑n=1∞π(n)n2<∞?\sum_{n=1}^{\infty} \frac{\pi(n)}{n^2} < \infty?

    Hints and solution

  3. Problem 3 (Day 1)

    Suppose that a function f ⁣:R→Rf\colon \mathbb{R} \to \mathbb{R} satisfies the inequality

    ∣∑k=1n3k(f(x+ky)−f(x−ky))∣≤1(1)\left| \sum_{k=1}^{n} 3^k\big(f(x + ky) - f(x - ky)\big) \right| \le 1 \qquad (1)

    for every positive integer nn and for all x,y∈Rx, y \in \mathbb{R}. Prove that ff is a constant function.

    Hints and solution

  4. Problem 4 (Day 1)

    Find all strictly monotonic functions f ⁣:(0,+∞)→(0,+∞)f\colon (0, +\infty) \to (0, +\infty) such that f(x2f(x))≡xf\left(\frac{x^2}{f(x)}\right) \equiv x.

    Hints and solution

  5. Problem 5 (Day 1)

    Suppose that 2n2n points of an n×nn \times n grid are marked. Show that for some k>1k > 1 one can select 2k2k distinct marked points, say a1,…,a2ka_1, \dots, a_{2k}, such that a1a_1 and a2a_2 are in the same row, a2a_2 and a3a_3 are in the same column, …\dots, a2k−1a_{2k-1} and a2ka_{2k} are in the same row, and a2ka_{2k} and a1a_1 are in the same column.

    Hints and solution

  6. Problem 6 (Day 1)

    a) For each 1<p<∞1 < p < \infty find a constant cp<∞c_p < \infty for which the following statement holds: If f ⁣:[−1,1]→Rf\colon [-1, 1] \to \mathbb{R} is a continuously differentiable function satisfying f(1)>f(−1)f(1) > f(-1) and ∣f′(y)∣≤1|f'(y)| \le 1 for all y∈[−1,1]y \in [-1, 1], then there is an x∈[−1,1]x \in [-1, 1] such that f′(x)>0f'(x) > 0 and ∣f(y)−f(x)∣≤cp(f′(x))1/p∣y−x∣|f(y) - f(x)| \le c_p\big(f'(x)\big)^{1/p}|y - x| for all y∈[−1,1]y \in [-1, 1]. (10 points)

    b) Does such a constant also exist for p=1p = 1? (10 points)

    Hints and solution

  7. Problem 1 (Day 2)

    Suppose that in a not necessarily commutative ring RR the square of any element is 00. Prove that abc+abc=0abc + abc = 0 for any three elements a,b,ca, b, c.

    Hints and solution

  8. Problem 2 (Day 2)

    We throw a dice (which selects one of the numbers 1,2,…,61, 2, \dots, 6 with equal probability) nn times. What is the probability that the sum of the values is divisible by 55?

    Hints and solution

  9. Problem 3 (Day 2)

    Assume that x1,…,xn≥−1x_1, \dots, x_n \ge -1 and ∑i=1nxi3=0\sum_{i=1}^{n} x_i^3 = 0. Prove that ∑i=1nxi≤n3\sum_{i=1}^{n} x_i \le \frac{n}{3}.

    Hints and solution

  10. Problem 4 (Day 2)

    Prove that there exists no function f ⁣:(0,+∞)→(0,+∞)f\colon (0, +\infty) \to (0, +\infty) such that f2(x)≥f(x+y)(f(x)+y)f^2(x) \ge f(x + y)\big(f(x) + y\big) for any x,y>0x, y > 0.

    Hints and solution

  11. Problem 5 (Day 2)

    Let SS be the set of all words consisting of the letters x,y,zx, y, z, and consider an equivalence relation ∼\sim on SS satisfying the following conditions: for arbitrary words u,v,w∈Su, v, w \in S

    (i) uu∼uuu \sim u;

    (ii) if v∼wv \sim w, then uv∼uwuv \sim uw and vu∼wuvu \sim wu.

    Show that every word in SS is equivalent to a word of length at most 88.

    Hints and solution

  12. Problem 6 (Day 2)

    Let AA be a subset of Zn=Z/nZ\mathbb{Z}_n = \mathbb{Z}/n\mathbb{Z} containing at most 1100ln⁡n\frac{1}{100}\ln n elements. Define the rrth Fourier coefficient of AA for r∈Znr \in \mathbb{Z}_n by

    f(r)=∑s∈Aexp⁡(2πinsr).f(r) = \sum_{s \in A} \exp\left(\frac{2\pi i}{n} sr\right).

    Prove that there exists an r≠0r \ne 0, such that ∣f(r)∣≥∣A∣2|f(r)| \ge \frac{|A|}{2}.

    Hints and solution