BMO2 2025/2026

Problems, Step-by-Step Hints, and Solutions

Prepare for BMO2 →

← BMO2

1.
For any two positive integers mm and nn, we define l(m,n)l(m,n) as their least common multiple and h(m,n)h(m,n) as their highest common factor. Given a prime p>3p>3, let kk denote the number of ordered pairs of positive integers (m,n)(m,n) satisfying the equation
l(m,n)+h(m,n)=p4.l(m,n)+h(m,n)=p^4.
Determine the smallest possible value of kk across all choices of the prime p>3p>3.
2.
The convex quadrilateral ABCDABCD has sides ADAD and BCBC not parallel. The diagonals ACAC and BDBD intersect at XX. The perpendicular bisectors of sides ADAD and BCBC meet at YY. Suppose that YY lies strictly inside triangle XCDXCD.
Prove that AC=BDAC=BD if and only if XYXY bisects ∠DXC\angle DXC.
3.
Each cell of a 30×3030\times30 grid contains one of the numbers −1-1, 00 or 11 with each of these three numbers appearing exactly 300300 times.
Is it possible that the 6060 row and column sums are all different?
4.
Let NN be a positive integer and let (kn)n≥1(k_n)_{n\ge1} be a sequence of positive integers with all terms at most NN. Annabel begins by choosing integers x1,x2,…,xNx_1,x_2,\ldots,x_N. She then extends this to an infinite sequence (xn)n≥1(x_n)_{n\ge1} of integers by defining
xn=∑i=n−knn−1xix_n=\sum_{i=n-k_n}^{n-1}x_i
for each n>Nn>N.
Show that there are either finitely many strictly positive terms or finitely many strictly negative terms in the infinite sequence (xn)(x_n).