Scribd
Upload
259 views

Bmo1 2023

The document contains instructions and 6 problems for the British Mathematical Olympiad Round 1. It instructs students to show full written working and proofs for 3 1/2 hours. Earlier questions tend to be easier and one complete solution is better than several unfinished attempts. Calculators and protractors are forbidden. The problems involve: (1) finding possible values of n if a road has n houses numbered 1 to n and 1k numbers start with 2, (2) finding the maximum possible square numbers in a sequence, (3) proving points are collinear in a triangle, (4) finding the highest score one player can achieve in a grid game, (5) proving a number N divides a

Uploaded by

Biswanath Bhattacharya
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
259 views

Bmo1 2023

The document contains instructions and 6 problems for the British Mathematical Olympiad Round 1. It instructs students to show full written working and proofs for 3 1/2 hours. Earlier questions tend to be easier and one complete solution is better than several unfinished attempts. Calculators and protractors are forbidden. The problems involve: (1) finding possible values of n if a road has n houses numbered 1 to n and 1k numbers start with 2, (2) finding the maximum possible square numbers in a sequence, (3) proving points are collinear in a triangle, (4) finding the highest score one player can achieve in a grid game, (5) proving a number N divides a

Uploaded by

Biswanath Bhattacharya
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

MT

UK
MT

UK
UKMT

United Kingdom
Mathematics Trust

British Mathematical Olympiad


Round 1
Wednesday 16 November 2022
© 2022 UK Mathematics Trust

Instructions
1. Time allowed: 3 12 hours.
2. 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. Do not hand in rough work.
3. One complete solution will gain more credit than several unfinished attempts. It is more
important to complete a small number of questions than to try all the problems.
4. Each question carries 10 marks. However, earlier questions tend to be easier. In general you
are advised to concentrate on these problems first.
5. The use of rulers, set squares and compasses is allowed, but calculators and protractors are
forbidden. You are strongly encouraged to use geometrical instruments to construct large,
accurate diagrams for geometry problems.
6. Start each question on an official answer sheet on which there is a QR code.
7. 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 additional sheets.
8. Write on one side of the paper only. Make sure your writing and diagrams are clear and not
too faint. (Your work will be scanned for marking.)
9. Arrange your answer sheets in question order before they are collected. If you are not
submitting work for a particular problem, please remove the associated answer sheet.
10. To accommodate candidates sitting in other time zones, please do not discuss the paper
on the internet until 8am GMT on Friday 18 November when the solutions video will be
released at https://bmos.ukmt.org.uk
11. Do not turn over until told to do so.

Enquiries about the British Mathematical Olympiad should be sent to:


[email protected]
www.ukmt.org.uk
British Mathematical Olympiad Round 1 Wednesday 16 November 2022

1. A road has houses numbered from 1 to 𝑛, where 𝑛 is a three-digit number.


Exactly 1𝑘 of the numbers start with the digit 2, where 𝑘 is a positive integer.
Find the possible values of 𝑛.

2. A sequence of positive integers 𝑎 𝑛 begins with 𝑎 1 = 𝑎 and 𝑎 2 = 𝑏 for positive


integers 𝑎 and 𝑏. Subsequent terms in the sequence satisfy the following
two rules for all positive integers 𝑛:
𝑎 2𝑛+1 = 𝑎 2𝑛 𝑎 2𝑛−1 , 𝑎 2𝑛+2 = 𝑎 2𝑛+1 + 4.

Exactly 𝑚 of the numbers 𝑎 1 , 𝑎 2 , 𝑎 3 , . . . , 𝑎 2022 are square numbers. What is


the maximum possible value of 𝑚? Note that 𝑚 depends on 𝑎 and 𝑏, so the
maximum is over all possible choices of 𝑎 and 𝑏.

3. In an acute, non-isosceles triangle 𝐴𝐵𝐶 the midpoints of 𝐴𝐶 and 𝐴𝐵 are


𝐵1 and 𝐶1 respectively. A point 𝐷 lies on 𝐵𝐶 with 𝐶 between 𝐵 and 𝐷.
The point 𝐹 is such that ∠ 𝐴𝐹𝐶 is a right angle and ∠𝐷𝐶𝐹 = ∠𝐹𝐶 𝐴. The
point 𝐺 is such that ∠ 𝐴𝐺 𝐵 is a right angle and ∠𝐶𝐵𝐺 = ∠𝐺 𝐵𝐴. Prove that
𝐵1 , 𝐶1 , 𝐹 and 𝐺 are collinear.

4. Alex and Katy play a game on an 8 × 8 square grid made of 64 unit cells.
They take it in turns to play, with Alex going first. On Alex’s turn, he writes
‘A’ in an empty cell. On Katy’s turn, she writes ‘K’ in two empty cells that
share an edge. The game ends when one player cannot move. Katy’s score
is the number of Ks on the grid at the end of the game. What is the highest
score Katy can be sure to get if she plays well, no matter what Alex does?

5. For each integer 𝑛 ≥ 1, let 𝑓 (𝑛) be the number of lists of different positive
integers starting with 1 and ending with 𝑛, in which each term except the last
divides its successor. Prove that for each integer 𝑁 ≥ 1 there is an integer
𝑛 ≥ 1 such that 𝑁 divides 𝑓 (𝑛).
(So 𝑓 (1) = 1, 𝑓 (2) = 1 and 𝑓 (6) = 3.)

6. A circle Γ has radius 1. A line 𝑙 is such that the perpendicular distance from
𝑙 to the centre of Γ is strictly between 0 and 2. A frog chooses a point on Γ
whose perpendicular distance from 𝑙 is less than 1 and sits on that point. It
then performs a sequence of jumps. Each jump has length 1 and if a jump
starts on Γ it must end on 𝑙 and vice versa. Prove that after some finite
number of jumps the frog returns to a point it has been on before.

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

You might also like