olymmath

ELMO 2025

ELMO 2025.

Official paper

The official paper in 1 language

English

Other problems

Problem 1

Let Z>0\mathbb{Z}_{>0} denote the set of positive integers. Find all functions f ⁣:Z>0→Z>0f \colon \mathbb{Z}_{>0} \to \mathbb{Z}_{>0} such that for all positive integers mm and nn , fm(n)+f(mn)=f(m)f(n).f^m(n)+f(mn)=f(m)f(n).

Note: fm(n)=f(f(⋯f⏟m times(n)⋯ ))f^m(n)=\underbrace{f(f(\cdots f}_{m\text{ times}}(n)\cdots)) , that is, ff applied mm times to nn .

Seongjin Shim

Problem 2

A contest has 20252025 problems. Elmo initially knows that the answers are 11 , 22 , …\dots , 20252025 in some order. Every minute, Elmo selects a problem that has not been answered correctly, inputs an answer to it, and is told whether the answer is correct or incorrect. Elmo wins the contest if and only if he answers all 20252025 problems correctly in at most 20242024 attempts each. Can Elmo guarantee that he wins the contest?

Andrew Lin and Calvin Wang

Problem 3

Let nn be a positive integer and pp be a prime. In terms of nn and pp , find the largest nonnegative integer kk for which there exists a polynomial P(x)P(x) with integer coefficients satisfying the following conditions:

  • The xnx^n coefficient of P(x)P(x) is 11 .
  • pkp^k divides P(x)P(x) for all integers xx .

Aprameya Tripathy

Problem 4

In quadrilateral ABCDABCD with ∠BAD=∠BCD\angle BAD=\angle BCD , diagonal ACAC intersects the circumcircle of △BCD\triangle BCD at a point P≠CP \neq C . Let QQ , RR , SS and TT be the reflections of PP across AB‾\overline{AB} , BC‾\overline{BC} , CD‾\overline{CD} , and DA‾\overline{DA} , respectively. Prove that the circumcircle of △AQT\triangle AQT is tangent to line RSRS .

Benny Wang

Problem 5

Let kk be a positive integer. Define a sequence of positive integers a1a_1 , a2a_2 , …\dots by a1=1a_1=1 and an+1=an+kana_{n+1}=a_n+k^{a_n}for all positive integers nn . Show that there exist infinitely many primes pp such that for any integer rr , there exists an index mm such that am≡r(modp)a_m\equiv r\pmod p .

Oron Wang

Problem 6

Let n≥2n \ge 2 be an integer. An n×nn \times n grid is filled with the numbers 11 through nn such that each row contains every number exactly once and any two adjacent rows differ by exactly two elements. Find all nn such that for any valid labeling of the grid, there exists a set of nn cells, each with a different number, such that no two are on the same row or column.

Andrew Carratu