We say that an integer $a$ is co-prime to another integer $b$ if $\gcd(a, b) = 1$. For any integer $n, \varphi (n)$ is the number of integers from $1$ up to $|n|$ that are co-prime to $n$.
- Calculate $\varphi (5), \varphi (10)$ and $\varphi (20)$.
- Show that $\varphi (p) = p – 1$ for any prime $p$.
- Prove that if $a$ is co-prime to $b$ then the remainder of $a$ when divided by $b$ is also co-prime to $b$.