uniolympiads Ελληνικά

IMC 2023

All the problems of the year on one page, as on the contest paper.

Official files

  1. Problem 1 (Day 1)

    Find all functions f ⁣:R→Rf\colon \mathbb{R} \to \mathbb{R} that have a continuous second derivative and for which the equality f(7x+1)=49f(x)f(7x+1) = 49f(x) holds for all x∈Rx \in \mathbb{R}.

    Hints and solution

  2. Problem 2 (Day 1)

    Let AA, BB and CC be n×nn \times n matrices with complex entries satisfying

    A2=B2=C2andB3=ABC+2I.A^2 = B^2 = C^2 \quad \text{and} \quad B^3 = ABC + 2I.

    Prove that A6=IA^6 = I.

    Hints and solution

  3. Problem 3 (Day 1)

    Find all polynomials PP in two variables with real coefficients satisfying the identity

    P(x,y)P(z,t)=P(xz−yt,xt+yz).P(x, y)P(z, t) = P(xz - yt, xt + yz).

    Hints and solution

  4. Problem 4 (Day 1)

    Let pp be a prime number and let kk be a positive integer. Suppose that the numbers ai=ik+ia_i = i^k + i for i=0,1,…,p−1i = 0, 1, \dots, p-1 form a complete residue system modulo pp. What is the set of possible remainders of a2a_2 upon division by pp?

    Hints and solution

  5. Problem 5 (Day 1)

    Fix positive integers nn and kk such that 2≤k≤n2 \le k \le n and a set MM consisting of nn fruits. A permutation is a sequence x=(x1,x2,…,xn)x = (x_1, x_2, \dots, x_n) such that {x1,…,xn}=M\{x_1, \dots, x_n\} = M. Ivan prefers some (at least one) of these permutations. He realized that for every preferred permutation xx, there exist kk indices i1<i2<⋯<iki_1 < i_2 < \dots < i_k with the following property: for every 1≤j<k1 \le j < k, if he swaps xijx_{i_j} and xij+1x_{i_{j+1}}, he obtains another preferred permutation.

    Prove that he prefers at least k!k! permutations.

    Hints and solution

  6. Problem 6 (Day 2)

    Ivan writes the matrix (2324)\begin{pmatrix} 2 & 3 \\ 2 & 4 \end{pmatrix} on the board. Then he performs the following operation on the matrix several times:

    • he chooses a row or a column of the matrix, and
    • he multiplies or divides the chosen row or column entry-wise by the other row or column, respectively.

    Can Ivan end up with the matrix (2423)\begin{pmatrix} 2 & 4 \\ 2 & 3 \end{pmatrix} after finitely many steps?

    Hints and solution

  7. Problem 7 (Day 2)

    Let VV be the set of all continuous functions f ⁣:[0,1]→Rf\colon [0, 1] \to \mathbb{R}, differentiable on (0,1)(0, 1), with the property that f(0)=0f(0) = 0 and f(1)=1f(1) = 1. Determine all α∈R\alpha \in \mathbb{R} such that for every f∈Vf \in V, there exists some ξ∈(0,1)\xi \in (0, 1) such that

    f(ξ)+α=f′(ξ).f(\xi) + \alpha = f'(\xi).

    Hints and solution

  8. Problem 8 (Day 2)

    Let TT be a tree with nn vertices; that is, a connected simple graph on nn vertices that contains no cycle. For every pair u,vu, v of vertices, let d(u,v)d(u, v) denote the distance between uu and vv, that is, the number of edges in the shortest path in TT that connects uu with vv.

    Consider the sums

    W(T)=∑{u,v}⊆V(T)u≠vd(u,v)andH(T)=∑{u,v}⊆V(T)u≠v1d(u,v).W(T) = \sum_{\substack{\{u,v\} \subseteq V(T) \\ u \ne v}} d(u, v) \quad \text{and} \quad H(T) = \sum_{\substack{\{u,v\} \subseteq V(T) \\ u \ne v}} \frac{1}{d(u, v)}.

    Prove that

    W(T)⋅H(T)≥(n−1)3(n+2)4.W(T) \cdot H(T) \ge \frac{(n-1)^3(n+2)}{4}.

    Hints and solution

  9. Problem 9 (Day 2)

    We say that a real number VV is good if there exist two closed convex subsets XX, YY of the unit cube in R3\mathbb{R}^3, with volume VV each, such that for each of the three coordinate planes (that is, the planes spanned by any two of the three coordinate axes), the projections of XX and YY onto that plane are disjoint.

    Find sup⁡{V∣V is good}\sup\{V \mid V \text{ is good}\}.

    Hints and solution

  10. Problem 10 (Day 2)

    For every positive integer nn, let f(n),g(n)f(n), g(n) be the minimal positive integers such that

    1+11!+12!+⋯+1n!=f(n)g(n).1 + \frac{1}{1!} + \frac{1}{2!} + \dots + \frac{1}{n!} = \frac{f(n)}{g(n)}.

    Determine whether there exists a positive integer nn for which g(n)>n0.999ng(n) > n^{0.999n}.

    Hints and solution