The whole British Mathematical Olympiad Round 1 2019 paper, one question at a time in order (6 questions). Press Mark as done after each one: your marks add up below.
Show that there are at least three prime numbers \(p\) less than 200 for which \(p + 2\),\(p + 6\), \(p + 8\) and \(p + 12\) are all prime. Show also that there is only one prime number \(q\) for which \(q + 2\),\(q + 6\),\(q + 8\), \(q + 12\) and \(q + 14\) are all prime.
A sequence of integers \(a_1, a_2, a_3, \ldots\) satisfies the relation:\[4a_{n+1}^2 - 4a_na_{n+1} + a_n^2 - 1 = 0\]for all positive integers \(n\). What are the possible values of \(a_1\)?
Two circles \(S_1\) and \(S_2\) are tangent at \(P\). A common tangent, not through \(P\), touches \(S_1\) at \(A\) and \(S_2\) at \(B\). Points \(C\) and \(D\), on \(S_1\) and \(S_2\) respectively, are outside the triangle \(APB\) and are such that \(P\) is on the line \(CD\).
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?
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?
A function \(f\) is called good if it assigns an integer value \(f(m, n)\) to every ordered pair of integers \((m, n)\) in such a way that for every pair of integers \((m, n)\) we have:\[2f(m, n) = f(m - n, n - m) + m + n = f(m + 1, n) + f(m, n + 1) - 1.\]Find all good functions.
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