British Mathematical Olympiad Round 1 (BMO1): Counting, Probability & Logic

7 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 Q3

3.

A square piece of paper is folded in half along a line of symmetry. The resulting shape is then folded in half along a line of symmetry of the new shape. This process is repeated until \(n\) folds have been made, giving a sequence of \(n + 1\) shapes. If we do not distinguish between congruent shapes, find the number of possible sequences when:

(a)

\(n = 3\);

(b)

\(n = 6\);

(c)

\(n = 9\).

(When \(n = 1\) there are two possible sequences.)

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

BMO1 2020 Q7

BMO1Current spec10 marksCounting, Probability & Logic
7.

Evie and Odette are playing a game. Three pebbles are placed on the number line; one at \(-2020\), one at 2020, and one at \(n\), where \(n\) is an integer between \(-2020\) and 2020. They take it in turns moving either the leftmost or the rightmost pebble to an integer between the other two pebbles. The game ends when the pebbles occupy three consecutive integers.

Odette wins if their sum is odd; Evie wins if their sum is even. For how many values of \(n\) can Evie guarantee victory if:

(a)

Odette goes first;

(b)

Evie goes first?

British Mathematical Olympiad Round 1 2020, Question 7. © 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 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

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