The whole British Mathematical Olympiad Round 2 2019 paper, one question at a time in order (4 questions). Press Mark as done after each one: your marks add up below.
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\).
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