The whole British Mathematical Olympiad Round 2 2020 paper, one question at a time in order (4 questions). Press Mark as done after each one: your marks add up below.
A sequence \(a_1, a_2, a_3, \ldots\) has \(a_1 > 2\) and satisfies:\[a_{n+1} = \frac{a_n(a_n - 1)}{2}\]for all positive integers \(n\). For which values of \(a_1\) are all the terms of the sequence odd integers?
Describe all collections \(S\) of at least four points in the plane such that no three points are collinear and such that every triangle formed by three points in \(S\) has the same circumradius.
(The circumradius of a triangle is the radius of the circle passing through all three of its vertices.)
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.)
A sequence \(b_1, b_2, b_3, \ldots\) of nonzero real numbers has the property that\[b_{n+2} = \frac{b_{n+1}^2 - 1}{b_n}\]for all positive integers \(n\).
Suppose that \(b_1 = 1\) and \(b_2 = k\) where \(1 < k < 2\). Show that there is some constant \(B\), depending on \(k\), such that \(-B \le b_n \le B\) for all \(n\). Also show that, for some \(1 < k < 2\), there is a value of \(n\) such that \(b_n > 2020\).
We'd like to use Google Analytics cookies to count visits and see which pages help most. They're optional, and the site works exactly the same either way. Privacy policy