olymmath

IMC 2025

International Mathematics Competition for University Students 2025.

Official paper

The official paper in 2 languages

English (day1) · English (day2)

Other problems

Problem 1

Let P∈R[x]P \in \mathbb{R}[x] be a polynomial with real coefficients, and suppose deg⁡(P)≥2\operatorname{deg}(P) \geq 2 . For every x∈Rx \in \mathbb{R} , let ℓx⊂R2\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) Suppose that the degree of PP is odd. Show that ⋃x∈Rℓx=R2\bigcup_{x \in \mathbb{R}} \ell_x=\mathbb{R}^2 . b) Does there exist a polynomial of even degree for which the above equality still holds?

Problem 3

Denote by S\mathcal{S} the set of all real symmetric 2025×20252025 \times 2025 matrices of rank 11 whose entries take values −1-1 or +1+1 . Let A,B∈SA, B \in \mathcal{S} be matrices chosen independently uniformly at random. Find the probability that AA and BB commute, i.e. AB=BAA B=B A .

Problem 4

Let aa be an even positive integer. Find all real numbers xx such that ⌊ba+xa⋅ba−1⌋=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 denotes the largest integer that is no greater than xx .)

Problem 5

For a positive integer nn , let [n]={1,2,…,n}[n]=\{1,2, \ldots, 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 τ∈Tn\tau \in T_n as the number of distinct maps in the set {τ,τ∘τ,τ∘τ∘τ,…}\{\tau, \tau \circ \tau, \tau \circ \tau \circ \tau, \ldots\} where o denotes composition. Finally, let f(n)=max⁡τ∈Snord⁡(τ) and g(n)=max⁡τ∈Tnord⁡(τ).f(n)=\max _{\tau \in S_n} \operatorname{ord}(\tau) \text { and } g(n)=\max _{\tau \in T_n} \operatorname{ord}(\tau) . Prove that g(n)<f(n)+n0.501g(n)<f(n)+n^{0.501} for sufficiently large nn .

Problem 6

Let f:(0,∞)→Rf:(0, \infty) \rightarrow \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′(ξ)=kf(\xi)-\xi f^{\prime}(\xi)=k

Problem 7

Let Z>0\mathbb{Z}_{>0} be the set of positive integers. Find all nonempty subsets M⊆Z>0M \subseteq \mathbb{Z}_{>0} satisfying both of the following properties: a) if x∈Mx \in M , then 2x∈M2 x \in M , b) if x,y∈Mx, y \in M and x+yx+y is even, then x+y2∈M\frac{x+y}{2} \in M .

Problem 8

For an n×nn \times n real matrix A∈Mn(R)A \in M_n(\mathbb{R}) , denote by ARA^{\mathbb{R}} its counter-clockwise 90∘90^{\circ} rotation. (10 points) For example, [123456789]R=[369258147]\left[\begin{array}{lll} 1 & 2 & 3 4 & 5 & 6 7 & 8 & 9 \end{array}\right]^R=\left[\begin{array}{lll} 3 & 6 & 9 2 & 5 & 8 1 & 4 & 7 \end{array}\right] Prove that if A=ARA=A^R then for any eigenvalue λ\lambda of AA , we have Re⁡λ=0\operatorname{Re} \lambda=0 or Im⁡λ=0\operatorname{Im} \lambda=0 .

Problem 9

Let nn be a positive integer. Consider the following random process which produces nn sequence of nn distinct positive integers X1,X2…,XnX_1, X_2 \ldots, X_n . First, X1X_1 is chosen randomly with P(X1=i)=2−i\mathbb{P}\left(X_1=i\right)=2^{-i} for every positive integer ii . For 1≤j≤n−11 \leq j \leq n-1 . having chosen X1,…,XjX_1, \ldots, X_j , arrange the remaining positive integers in increasing order as n1<n2<n_1<n_2< ⋯\cdots , and choose Xj+1X_{j+1} randomly with P(Xj+1=ni)=2−i\mathbb{P}\left(X_{j+1}=n_i\right)=2^{-i} for every positive integer ii . Let Yn=max⁡{X1,…,Xn}Y_n=\max \left\{X_1, \ldots, X_n\right\} . Show that E[Yn]=∑i=1n2i2i−1\mathbb{E}\left[Y_n\right]=\sum_{i=1}^n \frac{2^i}{2^i-1} where E[Yn]\mathbb{E}\left[Y_n\right] is the expected value of YnY_n .

Problem 10

For any positive integer NN , let SNS_N be the number of pairs of integers 1≤a,b≤N1 \leq a, b \leq N such that the number (a2+a)(b2+b)\left(a^2+a\right)\left(b^2+b\right) is a perfect square. Prove that the limit lim⁡N→∞SNN\lim _{N \rightarrow \infty} \frac{S_N}{N} exists and find its value.