Scribd
Upload
133 views2 pages

Bmo2 2025

Uploaded by

abhishekoa39
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
133 views2 pages

Bmo2 2025

Uploaded by

abhishekoa39
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

British Mathematical Olympiad

Round 2
Wednesday 22 January 2025
© 2025 UK Mathematics Trust

supported by

Instructions
1. Do not turn over until the invigilator tells you to do so.
2. Time allowed: 3 12 hours.
3. Full written solutions – not just answers – are required, with complete proofs of any
assertions you may make. Marks awarded will depend on the clarity of your mathematical
presentation. Work in rough first, and then write up your best attempt.
4. You may hand in rough work where it contains calculations, examples or ideas not present
in your final attempt; write ‘ROUGH’ at the top of each page of rough work.
5. Each question carries 10 marks. One or two complete solutions will gain far more credit
than several unfinished attempts. It is more important to complete a small number of
questions than to try all the problems.
6. Protractors and calculators are forbidden. Rulers and compasses are permitted, and
indeed are encouraged for drawing accurate diagrams in geometry questions.
7. Start each question on an official answer sheet on which there is a QR code.
8. If you use additional sheets of (plain or lined) paper for a question, please write the following
in the top left-hand corner of each sheet. (i) The question number. (ii) The page number for
that question. (iii) The digits following the ‘:’ from the question’s answer sheet QR code.
Please do not write your name or initials on any additional sheets.
9. Write on one side of the paper only. Make sure your writing and diagrams are not too
faint. (Your work will be scanned for marking.) Arrange your answer sheets, including
rough work, in question order before they are collected. If you are not submitting work
for a particular problem, remove the associated answer sheet.
10. To accommodate candidates in other time zones, please do not discuss any aspect of the
paper on the internet until 12 noon GMT on Friday 24th January when the solutions
video will be released at https://bmos.ukmt.org.uk and at ukmt.org.uk/competition-papers
and also on YouTube. Candidates in time zones more than 5 hours ahead of GMT must sit
the paper on Thursday 23rd January 2025 (as defined locally). Do not share the content of
the paper (including in email) until the videos have been published.
11. Around 24 high-scoring students eligible to represent the UK at the International Mathe-
matical Olympiad will be invited to a training session held in Cambridge around the Easter
holidays.

Enquiries about the British Mathematical Olympiad should be sent to: challenges@ukmt.org.uk
British Mathematical Olympiad Round 2 Wednesday 22 January 2025

1
1. Prove that if 𝑛 is a positive integer, then 𝑛 can be written as a finite sum of reciprocals of
different triangular numbers.
𝑘 (𝑘+1)
[A triangular number is one of the form 2 for some positive integer 𝑘.]

2. In an acute-angled triangle 𝐴𝐵𝐶 with 𝐴𝐵 < 𝐴𝐶, the incentre is 𝐼 and the perpendicular
bisector of 𝐵𝐶 meets 𝐵𝐼 at 𝑃 and 𝐶 𝐼 at 𝑄. The circles 𝐵𝐼𝑄 and 𝐶 𝐼 𝑃 meet again at 𝑋. The
lines 𝐴𝑋 and 𝐵𝐶 meet at 𝐷.
Prove that 𝐷 lies on the circle 𝐴𝑄𝑃.

3. An 𝑛 × 𝑛 chessboard consists of 𝑛2 cells which are unit squares. Each cell is coloured
black or white so that cells with a common edge are different colours. Isaac muddles up
the colouring by repeatedly swapping either two complete columns or two complete rows.
Elijah wants to restore the original colouring by repeatedly swapping either two complete
columns or two complete rows.
In terms of 𝑛, what is the largest number of swaps that Elijah might need?

4. How many different sequences of positive integers satisfy 𝑢 1 = 1 and

(𝑢 2𝑛 + 𝑢 𝑛 + 1) 2025
𝑢 𝑛+1 =
𝑢 𝑛−1
for all 𝑛 ≥ 2?

© 2025 UK Mathematics Trust www.ukmt.org.uk

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy