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

Problem catalog

354 problems, IMC 1994–2026. Difficulty and “solved” / “near-0” are field-cohort statistics. How we compute this → About

difficulty:354 of 354
IMC 2026 · Day 1 · P1easyavg 8.1/10 · solved 74% · near-0 9% · disc 0.36

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)

IMC 2026 · Day 1 · P2mediumavg 5.5/10 · solved 47% · near-0 30% · disc 0.52

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?

linear algebra
IMC 2026 · Day 1 · P3hardavg 2.9/10 · solved 18% · near-0 54% · disc 0.49

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 …

combinatorics
IMC 2026 · Day 1 · P4very hardavg 1.7/10 · solved 10% · near-0 70% · disc 0.41

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 …

IMC 2026 · Day 1 · P5killeravg 0.0/10 · solved 0% · near-0 100% · disc 0.10

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 …

IMC 2026 · Day 2 · P6mediumavg 6.3/10 · solved 46% · near-0 13% · disc 0.60
  • (a) Is there a differentiable function f ⁣:RRf \colon \mathbb{R} \rightarrow \mathbb{R} such that f(f(x))=xf^{\prime}(f(x)) = x for every xRx \in \mathbb{R}?
  • (b) Is there a differentiable function …
IMC 2026 · Day 2 · P7mediumavg 5.4/10 · solved 43% · near-0 28% · disc 0.52

For a continuous function f ⁣:[0,1]Rf \colon [0,1] \rightarrow \mathbb{R}, let S(f)S(f) be the union of all straight segments in the plane joining points (x,0)(x, 0) and (f(x),1)(f(x), 1), where x[0,1]x \in [0,1]. Let A(f)A(f) be the area of S(f)S(f). Find the …

IMC 2026 · Day 2 · P8mediumavg 5.0/10 · solved 40% · near-0 28% · disc 0.54

Let n5n \geq 5, and suppose that A=(aij)A = \left( a_{i j} \right) is a real symmetric n×nn \times n matrix such that aii=0andaij{1,1} for ij.a_{i i} = 0 \quad \text{and} \quad a_{i j} \in \{-1, 1\} \text{ for } i \neq j. Assume that the scalar products of any two …

IMC 2026 · Day 2 · P9very hardavg 2.3/10 · solved 14% · near-0 66% · disc 0.55

Let a1,a2,a_{1}, a_{2}, \ldots be an infinite sequence of positive real numbers satisfying a1+a2++a2n1=an2a_{1} + a_{2} + \cdots + a_{2n-1} = a_{n}^{2} for all positive integers nn. Prove that an2n1a_{n} \geq 2 n - 1 for all positive integers nn. (proposed …

IMC 2026 · Day 2 · P10killeravg 0.6/10 · solved 4% · near-0 91% · disc 0.32

An infinite chessboard of size d>0d > 0 is obtained by colouring the interiors of the squares of an infinite square grid of side length dd alternately white and black following the usual chessboard pattern. The points belonging to …

IMC 2025 · Day 1 · P1easyavg 8.4/10 · solved 82% · near-0 7% · disc 0.40

Let PR[x]P \in \mathbb{R}[x] be a polynomial with real coefficients, and suppose deg(P)2\deg(P) \ge 2. For every xRx \in \mathbb{R}, let xR2\ell_x \subset \mathbb{R}^2 denote the line tangent to the graph of PP at the point (x,P(x))(x, P(x)). (a) …

IMC 2025 · Day 1 · P2hardavg 2.7/10 · solved 20% · near-0 62% · disc 0.37

Let f:RRf : \mathbb{R} \to \mathbb{R} be a twice continuously differentiable function, and suppose that 11f(x)dx=0\int_{-1}^{1} f(x)\,dx = 0 and f(1)=f(1)=1f(1) = f(-1) = 1. Prove that 11(f(x))2dx15,\int_{-1}^{1} (f''(x))^2\,dx \ge 15, and find all such functions for …

IMC 2025 · Day 1 · P3easyavg 6.3/10 · solved 57% · near-0 22% · disc 0.54

Denote by SS the set of all real symmetric 2025×20252025 \times 2025 matrices of rank 1 whose entries take values 1-1 or +1+1. Let A,BSA, B \in S be matrices chosen independently uniformly at random. Find the probability that AA and BB commute, …

IMC 2025 · Day 1 · P4hardavg 2.9/10 · solved 23% · near-0 62% · disc 0.53

Let aa be an even positive integer. Find all real numbers xx such that ba+xaba1=ba+x/a \left\lfloor \sqrt[a]{b^a + x} \cdot b^{a-1} \right\rfloor = b^a + \lfloor x/a \rfloor holds for every positive integer bb. (Here x\lfloor x \rfloor

number theory
IMC 2025 · Day 1 · P5killeravg 1.0/10 · solved 5% · near-0 79% · disc 0.49

For a positive integer nn, let [n]={1,2,,n}[n] = \{1, 2, \dots, n\}. Denote by SnS_n the set of all bijections from [n][n] to [n][n], and let TnT_n be the set of all maps from [n][n] to [n][n]. Define the order ord(τ)\operatorname{ord}(\tau) of a map …

IMC 2025 · Day 2 · P6easyavg 7.5/10 · solved 66% · near-0 13% · disc 0.38

Let f:(0,)Rf : (0, \infty) \to \mathbb{R} be a continuously differentiable function, and let b>a>0b > a > 0 be real numbers such that f(a)=f(b)=kf(a) = f(b) = k. Prove that there exists a point ξ(a,b)\xi \in (a, b) such that f(ξ)ξf(ξ)=k.f(\xi) - \xi f'(\xi) = k.

real analysis
IMC 2025 · Day 2 · P7mediumavg 5.5/10 · solved 39% · near-0 19% · disc 0.62

Let Z>0\mathbb{Z}_{>0} be the set of positive integers. Find all nonempty subsets MZ>0M \subseteq \mathbb{Z}_{>0} satisfying both of the following properties: (a) if xMx \in M, then 2xM2x \in M, (b) if x,yMx, y \in M and x+yx + y is even, then …

IMC 2025 · Day 2 · P8mediumavg 4.9/10 · solved 42% · near-0 31% · disc 0.60

For an n×nn \times n real matrix AMn(R)A \in M_n(\mathbb{R}), denote by ARA^R its counter-clockwise 9090^\circ rotation. For example, …

linear algebra
IMC 2025 · Day 2 · P9very hardavg 1.2/10 · solved 6% · near-0 74% · disc 0.54

Let nn be a positive integer. Consider the following random process which produces a sequence of nn distinct positive integers X1,X2,,XnX_1, X_2, \dots, X_n. First, X1X_1 is chosen randomly with P(X1=i)=2i\mathsf{P}(X_1 = i) = 2^{-i} for every positive …

probability
IMC 2025 · Day 2 · P10killeravg 0.2/10 · solved 1% · near-0 96% · disc 0.32

For any positive integer NN, let SNS_N be the number of pairs of integers 1a,bN1 \le a, b \le N such that the number (a2+a)(b2+b)(a^2 + a)(b^2 + b) is a perfect square. Prove that the limit limNSNN\lim_{N \to \infty} \frac{S_N}{N} exists and find its …

number theory
IMC 2024 · Day 1 · P1easyavg 8.4/10 · solved 79% · near-0 7% · disc 0.41

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)

complex analysis
IMC 2024 · Day 1 · P2easyavg 6.0/10 · solved 54% · near-0 34% · disc 0.51

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, …

IMC 2024 · Day 1 · P3mediumavg 5.3/10 · solved 40% · near-0 30% · disc 0.55

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)

IMC 2024 · Day 1 · P4very hardavg 1.4/10 · solved 12% · near-0 82% · disc 0.52

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 …

group theory
IMC 2024 · Day 1 · P5killeravg 0.1/10 · solved 1% · near-0 97% · disc 0.25

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 …

IMC 2024 · Day 2 · P6easyavg 8.2/10 · solved 77% · near-0 11% · disc 0.35

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, …

IMC 2024 · Day 2 · P7easyavg 6.7/10 · solved 52% · near-0 16% · disc 0.55

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 …

IMC 2024 · Day 2 · P8mediumavg 4.8/10 · solved 34% · near-0 33% · disc 0.66

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 …

IMC 2024 · Day 2 · P9killeravg 0.2/10 · solved 1% · near-0 97% · disc 0.34

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: …

combinatorics
IMC 2024 · Day 2 · P10killeravg 0.3/10 · solved 2% · near-0 97% · disc 0.29

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

number theory