British Mathematical Olympiad Round 2 (BMO2): Counting, Probability & Logic

4 British Mathematical Olympiad Round 2 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.

BMO2 2020

BMO2 2019

BMO2 2018

BMO2 2020 Q3

BMO2Current spec10 marksCounting, Probability & Logic
3.

A \(2019 \times 2019\) square grid is made up of \(2019^2\) unit cells. Each cell is coloured either black or white. A colouring is called balanced if, within every square subgrid made up of \(k^2\) cells for \(1 \le k \le 2019\), the number of black cells differs from the number of white cells by at most one. How many different balanced colourings are there?

(Two colourings are different if there is at least one cell which is black in exactly one of them.)

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

BMO2 2019 Q2

2.

For some integer \(n\), a set of \(n^2\) magical chess pieces arrange themselves on a square \(n^2 \times n^2\) chessboard composed of \(n^4\) unit squares. At a signal, the chess pieces all teleport to another square of the chessboard such that the distance between the centres of their old and new squares is \(n\). The chess pieces win if, both before and after the signal, there are no two chess pieces in the same row or column. For which values of \(n\) can the chess pieces win?

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

BMO2 2018 Q2

2.

There are \(n\) places set for tea around a circular table, and every place has a small cake on a plate. Alice arrives first, sits at the table, and eats her cake (but it isn’t very nice). Next the Mad Hatter arrives, and tells Alice that she will have a lonely tea party, and that she must keep on changing her seat, and each time she must eat the cake in front of her (if it has not yet been eaten). In fact the Mad Hatter is very bossy, and tells Alice that, for \(i = 1, 2, \ldots, n - 1\), when she moves for the \(i\)-th time, she must move \(a_i\) places and he hands Alice the list of instructions \(a_1, a_2, \ldots, a_{n-1}\). Alice does not like the cakes, and she is free to choose, at every stage, whether to move clockwise or anticlockwise. For which values of \(n\) can the Mad Hatter force Alice to eat all the cakes?

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