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

Studolymp / IMC / 2019

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

Problems

Day 1

P1

Evaluate the product n=3(n3+3n)2n664.\prod_{n=3}^{\infty} \frac{(n^3 + 3n)^2}{n^6 - 64}. Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan and Karen Keryan, Yerevan State University and American University of Armenia, Yerevan

P2

A four-digit number YEARYEAR is called very good if the system Yx+Ey+Az+Rw=YRx+Yy+Ez+Aw=EAx+Ry+Yz+Ew=AEx+Ay+Rz+Yw=R\begin{align*} Yx + Ey + Az + Rw &= Y \\ Rx + Yy + Ez + Aw &= E \\ Ax + Ry + Yz + Ew &= A \\ Ex + Ay + Rz + Yw &= R \end{align*} of linear equations in the variables x,y,zx, y, z and ww has at least two solutions. Find all very good YEARYEARs in the 21st century.

(The 21st century starts in 2001 and ends in 2100.)

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

P3

Let f:(1,1)Rf : (-1, 1) \to \mathbb{R} be a twice differentiable function such that 2f(x)+xf(x)1for x(1,1).2 f'(x) + x f''(x) \ge 1 \quad \text{for } x \in (-1, 1). Prove that 11xf(x)dx13.\int_{-1}^{1} x f(x)\,dx \ge \frac13. Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan and Karim Rakhimov, Scuola Normale Superiore and National University of Uzbekistan

P4

Define the sequence a0,a1,a_0, a_1, \dots of numbers by the following recurrence: a0=1,a1=2,(n+3)an+2=(6n+9)an+1nanfor n0.a_0 = 1, \quad a_1 = 2, \quad (n + 3) a_{n+2} = (6n + 9) a_{n+1} - n a_n \quad \text{for } n \ge 0. Prove that all terms of this sequence are integers.

Proposed by Khakimboy Egamberganov, ICTP, Italy

P5

Determine whether there exist an odd positive integer nn and n×nn \times n matrices AA and BB with integer entries, that satisfy the following conditions:

(1) det(B)=1\det(B) = 1;

(2) AB=BAAB = BA;

(3) A4+4A2B2+16B4=2019IA^4 + 4 A^2 B^2 + 16 B^4 = 2019 I.

(Here II denotes the n×nn \times n identity matrix.)

Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan

Day 2

P6

Let f,g:RRf, g : \mathbb{R} \longrightarrow \mathbb{R} be continuous functions such that gg is differentiable. Assume that (f(0)g(0))(g(1)f(1))>0\bigl( f(0) - g'(0) \bigr) \bigl( g'(1) - f(1) \bigr) > 0. Show that there exists a point c(0,1)c \in (0, 1) such that f(c)=g(c)f(c) = g'(c).

Proposed by Fereshteh Malek, K. N. Toosi University of Technology

P7

Let C={4,6,8,9,10,}C = \{4, 6, 8, 9, 10, \dots\} be the set of composite positive integers. For each nCn \in C let ana_n be the smallest positive integer kk such that k!k! is divisible by nn. Determine whether the following series converges: nC(ann)n.(1)\tag{1} \sum_{n \in C} \left( \frac{a_n}{n} \right)^n. Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan

P8

Let x1,,xnx_1, \dots, x_n be real numbers. For any set I{1,2,,n}I \subset \{1, 2, \dots, n\} let s(I)=iIxis(I) = \sum\limits_{i \in I} x_i. Assume that the function Is(I)I \mapsto s(I) takes on at least 1.8n1.8^n values where II runs over all 2n2^n subsets of {1,2,,n}\{1, 2, \dots, n\}. Prove that the number of sets I{1,2,,n}I \subset \{1, 2, \dots, n\} for which s(I)=2019s(I) = 2019 does not exceed 1.7n1.7^n.

Proposed by Fedor Part and Fedor Petrov, St. Petersburg State University

P9

Determine all positive integers nn for which there exist n×nn \times n real invertible matrices AA and BB that satisfy ABBA=B2AAB - BA = B^2 A.

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

P10

2019 points are chosen at random, independently, and distributed uniformly in the unit disc {(x,y)R2:x2+y21}\{ (x, y) \in \mathbb{R}^2 : x^2 + y^2 \le 1 \}. Let CC be the convex hull of the chosen points. Which probability is larger: that CC is a polygon with three vertices, or a polygon with four vertices?

Proposed by Fedor Petrov, St. Petersburg State University