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

Studolymp / IMC / 2017

IMC 2017
contestants 331 · problems 10 (5+5) · scale 0–10 · per-problem yes

Problems

Day 1

Problem 1

Determine all complex numbers λ\lambda for which there exist a positive integer nn and a real n×nn \times n matrix AA such that A2=ATA^2 = A^T and λ\lambda is an eigenvalue of AA.

(Proposed by Alexandr Bolbot, Novosibirsk State University)

Problem 2

Let f:R(0,)f : \mathbb{R} \to (0, \infty) be a differentiable function, and suppose that there exists a constant L>0L > 0 such that f(x)f(y)Lxy\bigl| f'(x) - f'(y) \bigr| \le L \bigl| x - y \bigr| for all x,yx, y. Prove that (f(x))2<2Lf(x)\bigl( f'(x) \bigr)^2 < 2 L f(x) holds for all xx.

(Proposed by Jan Šustek, University of Ostrava)

Problem 3

For any positive integer mm, denote by P(m)P(m) the product of positive divisors of mm (e.g. P(6)=36P(6) = 36). For every positive integer nn define the sequence a1(n)=n,ak+1(n)=P(ak(n))(k=1,2,,2016).a_1(n) = n, \qquad a_{k+1}(n) = P(a_k(n)) \quad (k = 1, 2, \dots, 2016). Determine whether for every set S{1,2,,2017}S \subseteq \{1, 2, \dots, 2017\}, there exists a positive integer nn such that the following condition is satisfied:

For every kk with 1k20171 \le k \le 2017, the number ak(n)a_k(n) is a perfect square if and only if kSk \in S.

(Proposed by Matko Ljulj, University of Zagreb)

Problem 4

There are nn people in a city, and each of them has exactly 1000 friends (friendship is always symmetric). Prove that it is possible to select a group SS of people such that at least n/2017n/2017 persons in SS have exactly two friends in SS.

(Proposed by Rooholah Majdodin and Fedor Petrov, St. Petersburg State University)

Problem 5

Let kk and nn be positive integers with nk23k+4n \ge k^2 - 3k + 4, and let f(z)=zn1+cn2zn2++c0f(z) = z^{n-1} + c_{n-2} z^{n-2} + \dots + c_0 be a polynomial with complex coefficients such that c0cn2=c1cn3==cn2c0=0.c_0 c_{n-2} = c_1 c_{n-3} = \dots = c_{n-2} c_0 = 0. Prove that f(z)f(z) and zn1z^n - 1 have at most nkn - k common roots.

(Proposed by Vsevolod Lev and Fedor Petrov, St. Petersburg State University)

Day 2

Problem 6

Let f:[0;+)Rf : [0; +\infty) \to \mathbb{R} be a continuous function such that limx+f(x)=L\lim\limits_{x \to +\infty} f(x) = L exists (it may be finite or infinite). Prove that limn01f(nx)dx=L.\lim_{n \to \infty} \int_0^1 f(nx)\,dx = L. (Proposed by Alexandr Bolbot, Novosibirsk State University)

Problem 7

Let p(x)p(x) be a nonconstant polynomial with real coefficients. For every positive integer nn, let qn(x)=(x+1)np(x)+xnp(x+1).q_n(x) = (x+1)^n p(x) + x^n p(x+1). Prove that there are only finitely many numbers nn such that all roots of qn(x)q_n(x) are real.

(Proposed by Alexandr Bolbot, Novosibirsk State University)

Problem 8

Define the sequence A1,A2,A_1, A_2, \dots of matrices by the following recurrence: A1=(0110),An+1=(AnI2nI2nAn)(n=1,2,)A_1 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad A_{n+1} = \begin{pmatrix} A_n & I_{2^n} \\ I_{2^n} & A_n \end{pmatrix} \quad (n = 1, 2, \dots) where ImI_m is the m×mm \times m identity matrix.

Prove that AnA_n has n+1n + 1 distinct integer eigenvalues λ0<λ1<<λn\lambda_0 < \lambda_1 < \dots < \lambda_n with multiplicities (n0),(n1),,(nn)\binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n}, respectively.

(Proposed by Snježana Majstorović, University of J. J. Strossmayer in Osijek, Croatia)

Problem 9

Define the sequence f1,f2,:[0,1)Rf_1, f_2, \dots : [0, 1) \to \mathbb{R} of continuously differentiable functions by the following recurrence: f1=1;fn+1=fnfn+1 on (0,1), and fn+1(0)=1.f_1 = 1; \qquad f'_{n+1} = f_n f_{n+1} \text{ on } (0, 1), \text{ and } f_{n+1}(0) = 1. Show that limnfn(x)\lim\limits_{n \to \infty} f_n(x) exists for every x[0,1)x \in [0, 1) and determine the limit function.

(Proposed by Tomáš Bárta, Charles University, Prague)

Problem 10

Let KK be an equilateral triangle in the plane. Prove that for every p>0p > 0 there exists an ε>0\varepsilon > 0 with the following property: If nn is a positive integer, and T1,,TnT_1, \dots, T_n are non-overlapping triangles inside KK such that each of them is homothetic to KK with a negative ratio, and =1narea(T)>area(K)ε,\sum_{\ell=1}^{n} \operatorname{area}(T_\ell) > \operatorname{area}(K) - \varepsilon, then =1nperimeter(T)>p.\sum_{\ell=1}^{n} \operatorname{perimeter}(T_\ell) > p. (Proposed by Fedor Malyshev, Steklov Math. Inst. and Ilya Bogdanov, MIPT, Moscow)