British Mathematical Olympiad Round 1 (BMO1): Factors, Primes & Digits

8 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 2018

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 Q1

BMO1Current spec10 marksFactors, Primes & Digits
1.

Show that there are at least three prime numbers \(p\) less than 200 for which \(p + 2\), \(p + 6\), \(p + 8\) and \(p + 12\) are all prime. Show also that there is only one prime number \(q\) for which \(q + 2\), \(q + 6\), \(q + 8\), \(q + 12\) and \(q + 14\) are all prime.

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

BMO1 2019 Q4

4.

There are 2019 penguins waddling towards their favourite restaurant. As the penguins arrive, they are handed tickets numbered in ascending order from 1 to 2019, and told to join the queue. The first penguin starts the queue. For each \(n > 1\) the penguin holding ticket number \(n\) finds the greatest \(m < n\) which divides \(n\) and enters the queue directly behind the penguin holding ticket number \(m\). This continues until all 2019 penguins are in the queue.

(a)

How many penguins are in front of the penguin with ticket number 2?

(b)

What numbers are on the tickets held by the penguins just in front of and just behind the penguin holding ticket 33?

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

BMO1 2018 Q1

1.

A list of five two-digit positive integers is written in increasing order on a blackboard. Each of the five integers is a multiple of 3, and each digit 0,1,2,3,4,5,6,7,8,9 appears exactly once on the blackboard. In how many ways can this be done? Note that a two-digit number cannot begin with the digit 0.

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

BMO1 2018 Q2

2.

For each positive integer \(n \ge 3\), we define an \(n\)-ring to be a circular arrangement of \(n\) (not necessarily different) positive integers such that the product of every three neighbouring integers is \(n\). Determine the number of integers \(n\) in the range \(3 \le n \le 2018\) for which it is possible to form an \(n\)-ring.

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

BMO1 2018 Q6

6.

Ada the ant starts at a point \(O\) on a plane. At the start of each minute she chooses North, South, East or West, and marches 1 metre in that direction. At the end of 2018 minutes she finds herself back at \(O\). Let \(n\) be the number of possible journeys which she could have made. What is the highest power of 10 which divides \(n\)?

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