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

Studolymp / IMC / 2026

IMC 2026
contestants 453 · problems 5 · scale 0–10 · per-problem yes

IMC 2026 is under way in Blagoevgrad, Bulgaria (27 July – 3 August 2026).

The competition is running right now. Problems, individual results and the difficulty statistics appear on this page as the organisers publish them — there is nothing to show for a part of the competition that has not happened yet.

Day 1 was contested on 29 July 2026.

Problems

Day 1

Problem 1

Show that the equation cos(cosx)=sin(sinx)\cos (\cos x) = \sin (\sin x) has no real solutions.

(proposed by Alexander Slávik, Charles University, Prague)

Problem 2

Let nn be a positive integer. Suppose that AA and BB are n×nn \times n matrices with real entries such that AA+BB=AB+BA,A^{\top} A + B B^{\top} = A B + B A, where XX^{\top} denotes the transpose of matrix XX.

Does this imply that AB=BAA B = B A?

(proposed by Nikolaos Kolliopoulos, University of Cyprus)

Problem 3

Consider a deck of n2n \geq 2 cards labeled 1,2,,n1, 2, \ldots, n. An alternating shuffle of the deck is performed as follows. We split the deck into two non-empty stacks. We then sort the first stack in increasing order, and the second stack in decreasing order. Finally, we alternately take cards from the first and second stacks (starting with the first). If one of the stacks runs out, the remaining cards from the other stack are placed at the end. How many different final orders of the deck can be obtained in this way?

Example: Suppose n=6n = 6, the first stack is A=(1,3)A = (1, 3), and the second stack is B=(6,5,4,2)B = (6, 5, 4, 2). Then the order resulting from the alternating shuffle is (1,6,3,5,4,2)(1, 6, 3, 5, 4, 2).

(proposed by Daniel Volostnov, Neapolis University Paphos, Cyprus)

Problem 4

Let x1>0x_{1} > 0. Define the sequence {xn}\left\{ x_{n} \right\} by the recurrence xn+1=arctan(x1+x2++xnn) for all n1.x_{n+1} = \arctan \left( \frac{x_{1} + x_{2} + \cdots + x_{n}}{n} \right) \text{ for all } n \geq 1. Find limnxnlnn\lim\limits_{n \rightarrow \infty} x_{n} \sqrt{\ln n}, where lnx\ln x denotes the natural logarithm of xx.

(proposed by Wanlong Han, Henan, China)

Problem 5

Prove that there exists a constant C>0C > 0 such that for every pair A,BA, B of positive integers, there is a real polynomial p(x)p(x) with p(0)2>i=1Ap(i)2+i=1Bp(i)2anddegp<CAB.p(0)^{2} > \sum_{i=1}^{A} p(-i)^{2} + \sum_{i=1}^{B} p(i)^{2} \quad \text{and} \quad \operatorname{deg} p < C \sqrt{A B}.

(proposed by Géza Kós, Loránd Eötvös University, Budapest)