12 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.
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\).
Let \(ABC\) be a triangle. Let \(L\) be the line through \(B\) perpendicular to \(AB\). The perpendicular from \(A\) to \(BC\) meets \(L\) at the point \(D\). The perpendicular bisector of \(BC\) meets \(L\) at the point \(P\). Let \(E\) be the foot of the perpendicular from \(D\) to \(AC\).
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?
Find all functions \(f\) from the positive real numbers to the positive real numbers for which \(f(x) \le f(y)\) whenever \(x \le y\) and\[f(x^4) + f(x^2) + f(x) + f(1) = x^4 + x^2 + x + 1\]for all \(x > 0\).
Consider triangle \(ABC\). The midpoint of \(AC\) is \(M\). The circle tangent to \(BC\) at \(B\) and passing through \(M\) meets the line \(AB\) again at \(P\). Prove that \(AB \times BP = 2BM^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?
It is well known that, for each positive integer \(n\),\[1^3 + 2^3 + \cdots + n^3 = \frac{n^2(n + 1)^2}{4}\]and so is a square. Determine whether or not there is a positive integer \(m\) such that\[(m + 1)^3 + (m + 2)^3 + \cdots + (2m)^3\]is a square.
Let \(f\) be a function defined on the real numbers and taking real values. We say that \(f\) is absorbing if \(f(x) \le f(y)\) whenever \(x \le y\) and \(f^{2018}(z)\) is an integer for all real numbers \(z\).
a) Does there exist an absorbing function \(f\) such that \(f(x)\) is an integer for only finitely many values of \(x\)?
b) Does there exist an absorbing function \(f\) and an increasing sequence of real numbers \(a_1 < a_2 < a_3 < \ldots\) such that \(f(x)\) is an integer only if \(x = a_i\) for some \(i\)?
Note that if \(k\) is a positive integer and \(f\) is a function, then \(f^k\) denotes the composition of \(k\) copies of \(f\). For example \(f^3(t) = f(f(f(t)))\) for all real numbers \(t\).
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