British Mathematical Olympiad Round 1 (BMO1): Number & Arithmetic

4 British Mathematical Olympiad Round 1 questions from every year we have, newest year first. Use Difficulty › Position in the paper to practise the early (easier) or late (harder) questions, or the Year filter for one year.

Whole paper 2020 2019 2018

Questions and solutions © UK Mathematics Trust, shown with permission. Papers and more at ukmt.org.uk.

BMO1 2020

BMO1 2019

BMO1 2020 Q1

BMO1Current spec5 marksAlgebraNumber & Arithmetic
1.

Alice and Bob take it in turns to write numbers on a blackboard. Alice starts by writing an integer \(a\) between \(-100\) and 100 inclusive on the board. On each of Bob’s turns he writes twice the number Alice wrote last. On each of Alice’s subsequent turns she writes the number 45 less than the number Bob wrote last. At some point, the number \(a\) is written on the board for a second time. Find the possible values of \(a\).

British Mathematical Olympiad Round 1 2020, Question 1. © UK Mathematics Trust. Original paper on ukmt.org.uk

BMO1 2020 Q4

4.

In the equation\[\mathsf{A}^{\mathsf{AA}} + \mathsf{AA} = \mathsf{B{,}BBC{,}DED{,}BEE{,}BBB{,}BBE}\]the letters \(\mathsf{A}\), \(\mathsf{B}\), \(\mathsf{C}\), \(\mathsf{D}\) and \(\mathsf{E}\) represent different base 10 digits (so the right hand side is a sixteen digit number and \(\mathsf{AA}\) is a two digit number). Given that \(\mathsf{C} = 9\), find \(\mathsf{A}\), \(\mathsf{B}\), \(\mathsf{D}\) and \(\mathsf{E}\).

British Mathematical Olympiad Round 1 2020, Question 4. © UK Mathematics Trust. Original paper on ukmt.org.uk

BMO1 2020 Q6

6.

Given that an integer \(n\) is the sum of two different powers of 2 and also the sum of two different Mersenne primes, prove that \(n\) is the sum of two different square numbers.

(A Mersenne prime is a prime number which is one less than a power of two.)

British Mathematical Olympiad Round 1 2020, Question 6. © UK Mathematics Trust. Original paper on ukmt.org.uk

BMO1 2019 Q5

5.

Six children are evenly spaced around a circular table. Initially, one has a pile of \(n > 0\) sweets in front of them, and the others have nothing. If a child has at least four sweets in front of them, they may perform the following move: eat one sweet and give one sweet to each of their immediate neighbours and to the child directly opposite them. An arrangement is called perfect if there is a sequence of moves which results in each child having the same number of sweets in front of them. For which values of \(n\) is the initial arrangement perfect?

British Mathematical Olympiad Round 1 2019, Question 5. © UK Mathematics Trust. Original paper on ukmt.org.uk