Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

Studolymp / IMC / 2020

IMC 2020
contestants 546 · problems 8 (4+4) · scale 0–10 · per-problem yes

Problems

Day 1

P1

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}\{a, b, c, d\};

(2) ww contains an even number of letters aa;

(3) ww contains an even number of letters bb.

(For example, for n=2n = 2 there are 6 such words: aaaa, bbbb, cccc, dddd, cdcd and dcdc.)

Armend Sh. Shabani, University of Prishtina

P2

Let AA and BB be n×nn \times n real matrices such that rk(ABBA+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(n1).\operatorname{trace}(ABAB) - \operatorname{trace}(A^2 B^2) = \frac12 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

P3

Let d2d \ge 2 be an integer. Prove that there exists a constant C(d)C(d) such that the following holds: For any convex polytope KRdK \subset \mathbb{R}^d, which is symmetric about the origin, and any ε(0,1)\varepsilon \in (0, 1), there exists a convex polytope LRdL \subset \mathbb{R}^d with at most C(d)ε1dC(d) \varepsilon^{1-d} vertices such that (1ε)KLK.(1 - \varepsilon) K \subseteq L \subseteq K. (For a real α\alpha, a set TRdT \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 XRdX \subset \mathbb{R}^d of at most α\alpha points, i.e., T={xXtxxtx0,xXtx=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={λxxK}\lambda K = \{ \lambda x \mid x \in K \}. A set TRdT \subset \mathbb{R}^d is symmetric about the origin if (1)T=T(-1) T = T.)

Fedor Petrov, St. Petersburg State University

P4

A polynomial pp with real coefficients satisfies the equation p(x+1)p(x)=x100p(x + 1) - p(x) = x^{100} for all xRx \in \mathbb{R}. Prove that p(1t)p(t)p(1 - t) \geqslant p(t) for 0t1/20 \leqslant t \leqslant 1/2.

Daniil Klyuev, St. Petersburg State University

Day 2

P5

Find all twice continuously differentiable functions f:R(0,+)f : \mathbb{R} \to (0, +\infty) satisfying f(x)f(x)2(f(x))2f''(x) f(x) \ge 2 (f'(x))^2 for all xRx \in \mathbb{R}.

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

P6

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

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

P7

Let GG be a group and n2n \ge 2 be an integer. Let H1H_1 and H2H_2 be two subgroups of GG that satisfy [G:H1]=[G:H2]=nand[G:(H1H2)]=n(n1).[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 gGg \in G such that g1H1g=H2g^{-1} H_1 g = H_2.)

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

P8

Compute limn1loglognk=1n(1)k(nk)logk.\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