Paper 4, Section I, $1 E$

(i) Use Euclid's algorithm to find all pairs of integers $x$ and $y$ such that

$7 x+18 y=1$

(ii) Show that, if $n$ is odd, then $n^{3}-n$ is divisible by 24 .

*Typos? Please submit corrections to this page on GitHub.*

Paper 4, Section I, $1 E$

(i) Use Euclid's algorithm to find all pairs of integers $x$ and $y$ such that

$7 x+18 y=1$

(ii) Show that, if $n$ is odd, then $n^{3}-n$ is divisible by 24 .