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

Studolymp / IMC / 2021

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

Problems

Day 1

Problem 1

Let AA be a real n×nn \times n matrix such that A3=0A^3 = 0.

(a) Prove that there is a unique real n×nn \times n matrix XX that satisfies the equation X+AX+XA2=A.X + AX + XA^2 = A. (b) Express XX in terms of AA.

(proposed by Bekhzod Kurbonboev, Institute of Mathematics, Tashkent)

Problem 2

Let nn and kk be fixed positive integers, and let aa be an arbitrary non-negative integer. Choose a random kk-element subset XX of {1,2,…,k+a}\{1, 2, \dots, k+a\} uniformly (i.e., all kk-element subsets are chosen with the same probability) and, independently of XX, choose a random nn-element subset YY of {1,…,k+n+a}\{1, \dots, k+n+a\} uniformly.

Prove that the probability P(min⁡(Y)>max⁡(X))\mathsf{P} \bigl( \min(Y) > \max(X) \bigr) does not depend on aa.

(proposed by Fedor Petrov, St. Petersburg State University)

Problem 3

We say that a positive real number dd is good if there exists an infinite sequence a1,a2,a3,⋯∈(0,d)a_1, a_2, a_3, \dots \in (0, d) such that for each nn, the points a1,…,ana_1, \dots, a_n partition the interval [0,d][0, d] into segments of length at most 1/n1/n each. Find sup⁡{d∣d is good}.\sup \{ d \mid d \text{ is good} \}. (proposed by Josef Tkadlec)

Problem 4

Let f:R→Rf : \mathbb{R} \to \mathbb{R} be a function. Suppose that for every ε>0\varepsilon > 0, there exists a function g:R→(0,∞)g : \mathbb{R} \to (0, \infty) such that for every pair (x,y)(x, y) of real numbers, if ∣x−y∣<min⁡{g(x),g(y)}, then ∣f(x)−f(y)∣<ε.\text{if } |x - y| < \min\{ g(x), g(y) \}, \text{ then } |f(x) - f(y)| < \varepsilon. Prove that ff is the pointwise limit of a sequence of continuous R→R\mathbb{R} \to \mathbb{R} functions, i.e., there is a sequence h1,h2,…h_1, h_2, \dots of continuous R→R\mathbb{R} \to \mathbb{R} functions such that lim⁡n→∞hn(x)=f(x)\lim\limits_{n \to \infty} h_n(x) = f(x) for every x∈Rx \in \mathbb{R}.

(proposed by Camille Mau, Nanyang Technological University, Singapore)

Day 2

Problem 5

Let AA be a real n×nn \times n matrix and suppose that for every positive integer mm there exists a real symmetric matrix BB such that 2021B=Am+B2.2021 B = A^m + B^2. Prove that ∣det⁡A∣≤1|\det A| \le 1.

(proposed by Rafael Filipe dos Santos, Instituto Militar de Engenharia, Rio de Janeiro)

Problem 6

For a prime number pp, let GL⁡2(Z/pZ)\operatorname{GL}_2(\mathbb{Z}/ p\mathbb{Z}) be the group of invertible 2×22 \times 2 matrices of residues modulo pp, and let SpS_p be the symmetric group (the group of all permutations) on pp elements. Show that there is no injective group homomorphism φ:GL⁡2(Z/pZ)→Sp\varphi : \operatorname{GL}_2(\mathbb{Z}/p\mathbb{Z}) \to S_p.

(proposed by Thiago Landim, Sorbonne University, Paris)

Problem 7

Let D⊆CD \subseteq \mathbb{C} be an open set containing the closed unit disk {z:∣z∣≤1}\{ z : |z| \le 1 \}. Let f:D→Cf : D \to \mathbb{C} be a holomorphic function, and let p(z)p(z) be a monic polynomial. Prove that ∣f(0)∣≤max⁡∣z∣=1∣f(z)p(z)∣.\bigl| f(0) \bigr| \le \max_{|z|=1} \bigl| f(z) p(z) \bigr|. (proposed by Lars Hörmander)

Problem 8

Let nn be a positive integer. At most how many distinct unit vectors can be selected in Rn\mathbb{R}^n such that from any three of them, at least two are orthogonal?

(proposed by Alexander Polyanskii, Moscow Institute of Physics and Technology; based on results of Paul Erdős and Moshe Rosenfeld)