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

Studolymp / IMC / 2024

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

Problems

Day 1

P1

Determine all pairs (a,b)C×C(a, b) \in \mathbb{C} \times \mathbb{C} satisfying a=b=1anda+b+abˉR.|a| = |b| = 1 \quad \text{and} \quad a + b + a\bar{b} \in \mathbb{R}. (proposed by Mike Daas, Universiteit Leiden)

P2

For n=1,2,n = 1, 2, \dots let Sn=log(1122nnn2)log(n),S_n = \log \Bigl( \sqrt[n^2]{1^1 \cdot 2^2 \cdot \dots \cdot n^n} \Bigr) - \log(\sqrt{n}), where log\log denotes the natural logarithm. Find limnSn\lim\limits_{n \to \infty} S_n.

(proposed by Sergey Chernov, Belarusian State University, Minsk)

P3

For which positive integers nn does there exist an n×nn \times n matrix AA whose entries are all in {0,1}\{0, 1\}, such that A2A^2 is the matrix of all ones?

(proposed by Alex Avdiushenko, Neapolis University Paphos, Cyprus)

P4

Let gg and hh be two distinct elements of a group GG, and let nn be a positive integer. Consider a sequence w=(w1,w2,)w = (w_1, w_2, \dots) which is not eventually periodic and where each wiw_i is either gg or hh. Denote by HH the subgroup of GG generated by all elements of the form wkwk+1wk+n1w_k w_{k+1} \dots w_{k+n-1} with k1k \ge 1. Prove that HH does not depend on the choice of the sequence ww (but may depend on nn).

(proposed by Ivan Mitrofanov, Saarland University)

P5

Let n>dn > d be positive integers. Choose nn independent, uniformly distributed random points x1,,xnx_1, \dots, x_n in the unit ball BRdB \subset \mathbb{R}^d centered at the origin. For a point pBp \in B denote by f(p)f(p) the probability that the convex hull of x1,,xnx_1, \dots, x_n contains pp. Prove that if p,qBp, q \in B and the distance of pp from the origin is smaller than the distance of qq from the origin, then f(p)f(q)f(p) \ge f(q).

(proposed by Fedor Petrov, St Petersburg State University)

Day 2

P6

Prove that for any function f:QZf : \mathbb{Q} \to \mathbb{Z}, there exist a,b,cQa, b, c \in \mathbb{Q} such that a<b<ca < b < c, f(b)f(a)f(b) \ge f(a), and f(b)f(c)f(b) \ge f(c).

(proposed by Mehdi Golafshan &amp; Markus A. Whiteland, University of Liège, Liège)

P7

Let nn be a positive integer. Suppose that AA and BB are invertible n×nn \times n matrices with complex entries such that A+B=IA + B = I (where II is the identity matrix) and (A2+B2)(A4+B4)=A5+B5.(A^2 + B^2)(A^4 + B^4) = A^5 + B^5. Find all possible values of det(AB)\det(AB) for the given nn.

(proposed by Sergey Bondarev, Sergey Chernov, Belarusian State University, Minsk)

P8

Define the sequence x1,x2,x_1, x_2, \dots by the initial terms x1=2x_1 = 2, x2=4x_2 = 4, and the recurrence relation xn+2=3xn+12xn+2nxnfor n1.x_{n+2} = 3 x_{n+1} - 2 x_n + \frac{2^n}{x_n} \quad \text{for } n \ge 1. Prove that limnxn2n\lim\limits_{n \to \infty} \dfrac{x_n}{2^n} exists and satisfies 1+32limnxn2n32.\frac{1 + \sqrt{3}}{2} \le \lim_{n \to \infty} \frac{x_n}{2^n} \le \frac32. (proposed by Karen Keryan, Yerevan State University &amp; American University of Armenia, Armenia)

P9

A matrix A=(aij)A = (a_{ij}) is called nice, if it has the following properties:

(i) the set of all entries of AA is {1,2,,2t}\{1, 2, \dots, 2t\} for some integer tt;

(ii) the entries are non-decreasing in every row and in every column: ai,jai,j+1a_{i,j} \le a_{i,j+1} and ai,jai+1,ja_{i,j} \le a_{i+1,j};

(iii) equal entries can appear only in the same row or the same column: if ai,j=ak,a_{i,j} = a_{k,\ell}, then either i=ki = k or j=j = \ell;

(iv) for each s=1,2,,2t1s = 1, 2, \dots, 2t-1, there exist iki \ne k and jj \ne \ell such that ai,j=sa_{i,j} = s and ak,=s+1a_{k,\ell} = s + 1.

Prove that for any positive integers mm and nn, the number of nice m×nm \times n matrices is even.

For example, the only two nice 2×32 \times 3 matrices are (111222)\begin{pmatrix} 1 & 1 & 1 \\ 2 & 2 & 2 \end{pmatrix} and (113244)\begin{pmatrix} 1 & 1 & 3 \\ 2 & 4 & 4 \end{pmatrix}.

(proposed by Fedor Petrov, St Petersburg State University)

P10

We say that a square-free positive integer nn is almost prime if nxd1+xd2++xdkkxn \mid x^{d_1} + x^{d_2} + \dots + x^{d_k} - kx for all integers xx, where 1=d1<d2<<dk=n1 = d_1 < d_2 < \dots < d_k = n are all the positive divisors of nn. Suppose that rr is a Fermat prime (i.e. it is a prime of the form 22m+12^{2^m} + 1 for an integer m0m \ge 0), pp is a prime divisor of an almost prime integer nn, and p1(modr)p \equiv 1 \pmod r. Show that, with the above notation, di1(modr)d_i \equiv 1 \pmod r for all 1ik1 \le i \le k.

(An integer nn is called square-free if it is not divisible by d2d^2 for any integer d>1d > 1.)

(proposed by Tigran Hakobyan, Yerevan State University, Vanadzor, Armenia)