Start with what you can explain

BMO1 asks for complete written solutions. An answer on its own leaves the reader guessing how you got there. I would start by looking at a problem you have already attempted: which observation helped, where did the argument stop, and what still needs a reason?

The next BMO1 is on 18 November 2026. It has six problems in three and a half hours. Check the UKMT competition page for the current arrangements and eligibility. The examples below are independent preparation, not official BMO questions or a prediction of the paper.

A useful starting toolkit

This is a preparation checklist, not an official syllabus. Choose the part that is causing difficulty rather than trying to learn everything at once.

  • Algebra: factorisation, identities, equations in integers and simple inequalities.
  • Number theory: divisibility, prime factors, parity, remainders and modular arithmetic. Explain why a divisibility rule works.
  • Geometry: accurate diagrams, angles, similar triangles, circles and area. State the reason for each angle or length relation.
  • Counting: organise cases, avoid overlap, count the same objects in two ways and use the pigeonhole principle.
  • Proof: separate the assumptions from the conclusion, test counterexamples and decide when a direct argument or contradiction is useful.

Build the proof one decision at a time

  1. Explore. Try small cases or draw a diagram. Say what you notice and what you think might be true.
  2. Find the gap. Write a sentence beginning “It would be enough to show that…”. This often makes the next step clearer.
  3. Use a small hint. Ask for the next useful observation rather than the whole method. Then try to continue yourself.
  4. Write the argument. Define your variables, cover the cases and justify each claim. A few examples do not establish the general result.
  5. Change the problem. Alter a number or assumption. Check whether the same idea still works and explain why.

1. Odd squares

Prove that n² − 1 is divisible by 8 whenever n is an odd integer.

A first hint

Factor n² − 1. What can you say about n − 1 and n + 1?

A more specific hint

They are consecutive even integers. One is divisible by 4 and the other by 2.

Worked solution

Write n = 2k + 1 for an integer k. Then n² − 1 = 4k(k + 1). One of the consecutive integers k and k + 1 is even, so k(k + 1) = 2m for an integer m. Hence n² − 1 = 8m.

The factorisation (n − 1)(n + 1) expresses the same idea. It is not enough simply to say both factors are even: that would only guarantee divisibility by 4.

Follow-up: show that n⁴ − 1 is divisible by 16 for every odd n. Does 32 always divide it?

Follow-up solution

From the first result, n² = 8m + 1. Thus n⁴ − 1 = 64m² + 16m = 16m(4m + 1). It need not be divisible by 32: n = 3 gives 80.

2. Turn an equation into factors

Find all positive integer pairs (x, y) satisfying 1/x + 1/y = 1/6.

A first hint

Clear the denominators. Can you rearrange the equation so that x and y appear in separate factors?

A more specific hint

From xy − 6x − 6y = 0, add 36 to both sides.

Worked solution

Each positive term is less than 1/6, so x > 6 and y > 6. Rearranging gives (x − 6)(y − 6) = 36. The positive factor pairs of 36 with the first factor no larger than the second are (1,36), (2,18), (3,12), (4,9) and (6,6).

Adding 6 to each component gives (7,42), (8,24), (9,18), (10,15) and (12,12), together with the reversed pairs. Every listed pair satisfies the factored equation and hence the original equation, so the list is complete.

Follow-up: replace 6 by a positive integer m. What factorisation do you get, and how do the positive divisors of m² describe all the solutions?

Follow-up solution

The equation becomes (x − m)(y − m) = m². For each positive divisor d of m², take x = m + d and y = m + m²/d. These give all ordered positive integer solutions.

3. Choose a useful way to group the numbers

Choose eleven distinct integers from 1 to 20. Prove that one of the chosen numbers divides another.

A first hint

Group numbers that differ only by multiplying or dividing by 2.

A more specific hint

Repeatedly divide a number by 2 until it is odd. How many odd results are possible?

Worked solution

Every positive integer has a unique form 2ᵏq, where k is a non-negative integer and q is odd. For numbers from 1 to 20, q is one of 1, 3, 5, 7, 9, 11, 13, 15, 17 or 19.

Eleven chosen numbers occupy ten possible groups, so two have the same odd part q. Write them as 2ᵃq and 2ᵇq with a < b. The second is 2ᵇ⁻ᵃ times the first, so the first divides the second.

Follow-up: could ten chosen numbers be enough to guarantee the conclusion?

Follow-up solution

No. Choose 11, 12, …, 20. Twice any of these numbers is greater than 20, so none divides a different number in the set. Explain why a ratio of two distinct positive integers, when it is an integer, must be at least 2.

Using the weeks before BMO1

With about three weeks to go, keep the plan manageable. The amount of work should depend on how much you can review properly.

  1. First week: attempt a small selection from an older BMO1 paper. Identify two recurring gaps and work on those ideas using shorter problems.
  2. Second week: write complete solutions, compare them with the official explanations and rewrite any argument that skips a step. Add one unfamiliar problem using each idea.
  3. Final week: try an unseen paper under the stated conditions if you have time to review it. Practise choosing questions and returning to a problem after a break. Revisit earlier difficulties rather than collecting new techniques at the last minute.

After each session, ask: what can I now do without help, and which step still needs a prompt? That gives the next session a clear purpose.

What to use next

Use the BMO paper and solution archive for complete questions. The AIME practice guidance gives another way to work on numerical problem solving, while the printable teaching pack covers logic, algebra and further practice. Match the difficulty to the student and allow time for discussion.