Hallo CPhill,
In number theory, Euler's totient function (or Euler's phi function), denoted as φ(n) or ϕ(n), is an
arithmetic function that counts the positive integers less than or equal to n that are relatively prime to n.
(These integers are sometimes referred to as totatives of n.)
Thus, if n is a positive integer, then φ(n) is the
number of integers k in the range 1 ≤ k ≤ n for which the greatest common divisor gcd(n, k) = 1.[1][2]
see more... https://en.wikipedia.org/wiki/Euler%27s_totient_function