BMO1 2025/2026

Problems, Step-by-Step Hints, and Solutions

Prepare for BMO1 →

← BMO1

1.
A ramp is a sequence of three different positive integers a,b,ca,b,c such that aa is a factor of bb and bb is a factor of cc. For every prime number pp and every positive integer nn, determine with proof whether pnp^n can be expressed as the sum of a ramp.
2.
Find all triples (x,y,z)(x,y,z) of real numbers satisfying the equations
x2+2yz=4,y2+2zx=4,z2+2xy=1.x^2+2yz=4,\qquad y^2+2zx=4,\qquad z^2+2xy=1.
3.
An 11×1111\times11 square grid is dissected into 11 pieces as follows. At each step, remove the top row and the leftmost column of the remaining grid as a single piece. Thus, the pieces obtained are L-shaped with sizes 21,19,…,321,19,\ldots,3, together with a single square.
The pieces are rearranged to reassemble an 11×1111\times11 grid, with rotations allowed (but the pieces may not be turned over) so that the single square occupies the cell in the third row and third column (counting from the top left).
How many ways can this be done?

Solution 1

Solution 2

4.
Let ABCABC be an acute-angled triangle with AB>ACAB>AC. Let MM be the midpoint of BCBC. The circle passing through MM that is tangent to ABAB at BB and the circle passing through MM that is tangent to ACAC at CC intersect again at DD.
Prove that MA×MD=MB×MCMA\times MD=MB\times MC.
5.
George defines a sequence of positive integers t1,t2,t3,…t_1,t_2,t_3,\ldots as follows.
He first sets t1=1t_1=1. Then, for n≥1n\ge1:
• If tnt_n is even, then tn+1=tn/2t_{n+1}=t_n/2.
• If tnt_n is odd and greater than 1, then tn+1t_{n+1} is tn/3t_n/3 rounded to the nearest integer.
• If tn=1t_n=1, then tn+1=2025kt_{n+1}=2025k where kk is the number of terms equal to 1 amongst t1,t2,…,tnt_1,t_2,\ldots,t_n.
Does this sequence contain every positive integer?
6.
There are 1000 lily pads on a pond arranged in a circle and labelled 1, 2, ..., 1000 in order. (The first four lily pads may also be described using the labels 1001, 1002, 1003 and 1004, respectively.) The first n lily pads are each occupied by a frog with the remaining lily pads not occupied.

Each minute, exactly one of the frogs makes a move. Suppose the frog is on lily pad k. That frog may either:

(i) Swim to lily pad k + 4 or k - 4, provided that it is not occupied; or

(ii) Jump to lily pad k + 3 or k - 3 provided that this lily pad is not occupied and the two lily pads jumped over are both occupied. When this happens, the two frogs that were jumped over dive into the pond and don't participate in any further moves.

For which values of n is it possible, by a sequence of moves, to end with exactly one frog remaining on the lily pads?