uniolympiads Ελληνικά

IMC 2020

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

Official files

  1. Problem 1 (Day 1)

    Let nn be a positive integer. Compute the number of words ww (finite sequences of letters) that satisfy all the following three properties:

    (1) ww consists of nn letters, all of them are from the alphabet {a,b,c,d}\{\mathtt{a}, \mathtt{b}, \mathtt{c}, \mathtt{d}\};

    (2) ww contains an even number of letters a\mathtt{a};

    (3) ww contains an even number of letters b\mathtt{b}.

    (For example, for n=2n = 2 there are 66 such words: aa\mathtt{aa}, bb\mathtt{bb}, cc\mathtt{cc}, dd\mathtt{dd}, cd\mathtt{cd} and dc\mathtt{dc}.)

    Armend Sh. Shabani, University of Prishtina

    Hints and solution

  2. Problem 2 (Day 1)

    Let AA and BB be n×nn \times n real matrices such that

    rk⁡(AB−BA+I)=1\operatorname{rk}(AB - BA + I) = 1

    where II is the n×nn \times n identity matrix.

    Prove that

    trace⁡(ABAB)−trace⁡(A2B2)=12n(n−1).\operatorname{trace}(ABAB) - \operatorname{trace}(A^2B^2) = \frac{1}{2}n(n-1).

    (rk⁡(M)\operatorname{rk}(M) denotes the rank of matrix MM, i.e., the maximum number of linearly independent columns in MM. trace⁡(M)\operatorname{trace}(M) denotes the trace of MM, that is the sum of diagonal elements in MM.)

    Rustam Turdibaev, V. I. Romanovskiy Institute of Mathematics

    Hints and solution

  3. Problem 3 (Day 1)

    Let d≥2d \ge 2 be an integer. Prove that there exists a constant C(d)C(d) such that the following holds: For any convex polytope K⊂RdK \subset \mathbb{R}^d, which is symmetric about the origin, and any ε∈(0,1)\varepsilon \in (0, 1), there exists a convex polytope L⊂RdL \subset \mathbb{R}^d with at most C(d)ε1−dC(d)\varepsilon^{1-d} vertices such that

    (1−ε)K⊆L⊆K.(1 - \varepsilon)K \subseteq L \subseteq K.

    (For a real α\alpha, a set T⊂RdT \subset \mathbb{R}^d with nonempty interior is a convex polytope with at most α\alpha vertices, if TT is a convex hull of a set X⊂RdX \subset \mathbb{R}^d of at most α\alpha points, i.e., T={∑x∈Xtxx∣tx≥0,∑x∈Xtx=1}T = \{\sum_{x \in X} t_x x \mid t_x \ge 0, \sum_{x \in X} t_x = 1\}. For a real λ\lambda, put λK={λx∣x∈K}\lambda K = \{\lambda x \mid x \in K\}. A set T⊂RdT \subset \mathbb{R}^d is symmetric about the origin if (−1)T=T(-1)T = T.)

    Fedor Petrov, St. Petersburg State University

    Hints and solution

  4. Problem 4 (Day 1)

    A polynomial pp with real coefficients satisfies the equation p(x+1)−p(x)=x100p(x+1) - p(x) = x^{100} for all x∈Rx \in \mathbb{R}. Prove that p(1−t)≥p(t)p(1-t) \ge p(t) for 0≤t≤1/20 \le t \le 1/2.

    Daniil Klyuev, St. Petersburg State University

    Hints and solution

  5. Problem 5 (Day 2)

    Find all twice continuously differentiable functions f ⁣:R→(0,+∞)f\colon \mathbb{R} \to (0, +\infty) satisfying

    f′′(x)f(x)≥2(f′(x))2f''(x)f(x) \ge 2\big(f'(x)\big)^2

    for all x∈Rx \in \mathbb{R}.

    Karen Keryan, Yerevan State University & American University of Armenia, Yerevan

    Hints and solution

  6. Problem 6 (Day 2)

    Find all prime numbers pp for which there exists a unique a∈{1,2,…,p}a \in \{1, 2, \dots, p\} such that a3−3a+1a^3 - 3a + 1 is divisible by pp.

    Géza Kós, Loránd Eötvös University, Budapest

    Hints and solution

  7. Problem 7 (Day 2)

    Let GG be a group and n≥2n \ge 2 be an integer. Let H1H_1 and H2H_2 be two subgroups of GG that satisfy

    [G:H1]=[G:H2]=nand[G:(H1∩H2)]=n(n−1).[G : H_1] = [G : H_2] = n \quad \text{and} \quad [G : (H_1 \cap H_2)] = n(n-1).

    Prove that H1H_1 and H2H_2 are conjugate in GG.

    (Here [G:H][G : H] denotes the index of the subgroup HH, i.e. the number of distinct left cosets xHxH of HH in GG. The subgroups H1H_1 and H2H_2 are conjugate if there exists an element g∈Gg \in G such that g−1H1g=H2g^{-1}H_1 g = H_2.)

    Ilya Bogdanov and Alexander Matushkin, Moscow Institute of Physics and Technology

    Hints and solution

  8. Problem 8 (Day 2)

    Compute

    lim⁡n→∞1log⁡log⁡n∑k=1n(−1)k(nk)log⁡k.\lim_{n \to \infty} \frac{1}{\log\log n} \sum_{k=1}^{n} (-1)^k \binom{n}{k} \log k.

    (Here log⁡\log denotes the natural logarithm.)

    Fedor Petrov, St. Petersburg State University

    Hints and solution