Number Theory

1. Show that if \[\frac{1}{x} + \frac{2}{y} = \frac{2}{7}\,,\] then \((2x - 7)(y - 7) = 49\). By considering the factors of \(49\), find all the pairs of positive integers \(x\) and \(y\) such that \[\frac{1}{x} + \frac{2}{y} = \frac{2}{7}\,.\]
2. Let \(p\) and \(q\) be prime numbers such that \[p^2 + pq + q^2 = n^2\] where \(n\) is a positive integer. Show that \[(p + q + n)(p + q - n) = pq\] and hence explain why \(p + q = n + 1\). Hence find the possible values of \(p\) and \(q\).
3. Let \(p\) and \(q\) be positive and \[p^3 + q^3 + 3pq^2 = n^3\,.\] Show that \(p + q - n < p\) and \(p + q - n < q\). Show that there are no prime numbers \(p\) and \(q\) such that \(p^3 + q^3 + 3pq^2\) is the cube of an integer.

1. Suppose that there are three non-zero integers \(a\), \(b\) and \(c\) for which \(a^3 + 2b^3 + 4c^3 = 0\). Explain why there must exist an integer \(p\), with \(|p| < |a|\), such that \(4p^3 + b^3 + 2c^3 = 0\), and show further that there must exist integers \(p\), \(q\) and \(r\), with \(|p| < |a|\), \(|q| < |b|\) and \(|r| < |c|\), such that \(p^3 + 2q^3 + 4r^3 = 0\). Deduce that no such integers \(a\), \(b\) and \(c\) can exist.
2. Prove that there are no non-zero integers \(a\), \(b\) and \(c\) for which \(9a^3 + 10b^3 + 6c^3 = 0\).
3. By considering the expression \((3n \pm 1)^2\), prove that, unless an integer is a multiple of three, its square is one more than a multiple of \(3\). Deduce that the sum of the squares of two integers can only be a multiple of three if each of the integers is a multiple of three. Hence prove that there are no non-zero integers \(a\), \(b\) and \(c\) for which \(a^2 + b^2 = 3c^2\).
4. Prove that there are no non-zero integers \(a\), \(b\) and \(c\) for which \(a^2 + b^2 + c^2 = 4abc\).

If \(x\) is a positive integer, the value of the function \(\mathrm{d}(x)\) is the sum of the digits of \(x\) in base 10. For example, \(\mathrm{d}(249) = 2 + 4 + 9 = 15\). An \(n\)-digit positive integer \(x\) is written in the form \(\displaystyle\sum_{r=0}^{n-1} a_r \times 10^r\), where \(0 \leqslant a_r \leqslant 9\) for all \(0 \leqslant r \leqslant n-1\) and \(a_{n-1} > 0\).

1. Prove that \(x - \mathrm{d}(x)\) is non-negative and divisible by \(9\).
2. Prove that \(x - 44\mathrm{d}(x)\) is a multiple of \(9\) if and only if \(x\) is a multiple of \(9\). Suppose that \(x = 44\mathrm{d}(x)\). Show that if \(x\) has \(n\) digits, then \(x \leqslant 396n\) and \(x \geqslant 10^{n-1}\), and hence that \(n \leqslant 4\). Find a value of \(x\) for which \(x = 44\mathrm{d}(x)\). Show that there are no further values of \(x\) satisfying this equation.
3. Find a value of \(x\) for which \(x = 107\mathrm{d}\left(\mathrm{d}(x)\right)\). Show that there are no further values of \(x\) satisfying this equation.

The integers \(a,b\) and \(c\) satisfy \[ 2a^{2}+b^{2}=5c^{2}. \] By considering the possible values of \(a\pmod5\) and \(b\pmod5\), show that \(a\) and \(b\) must both be divisible by \(5\). By considering how many times \(a,b\) and \(c\) can be divided by \(5\), show that the only solution is \(a=b=c=0.\)

A secret message consists of the numbers \(1,3,7,23,24,37,39,43,43,43,45,47\) arranged in some order as \(a_{1},a_{2},\ldots,a_{12}.\) The message is encoded as \(b_{1},b_{2},\ldots,b_{12}\) with \(0\leqslant b_{j}\leqslant49\) and \begin{alignat*}{1} b_{2j} & \equiv a_{2j}+n_{0}+j\pmod{50},\\ b_{2j+1} & \equiv a_{2j+1}+n_{1}+j\pmod{50}, \end{alignat*} for some integers \(n_{0}\) and \(n_{1}.\) If the coded message is \(35,27,2,36,15,35,8,40,40,37,24,48,\) find the original message, explaining your method carefully.