Euler's Totient Function Examples 2
Recall from the Euler's Totient Function page that if $n \in \mathbb{N}$ then $\phi (n)$ denotes the number of positive integers less than or equal to $n$ that are relatively prime to $n$.
We made note of some important properties of this function including:
- If $p$ is a prime number then $\phi (p) = p - 1$.
- If $p$ is a prime number then $\phi (p^2) = p^2 - p$.
- If $p$ is a prime number and $k \in \mathbb{N}$ then $\phi (p^k) = p^k - p^{k-1} = (p - 1)p^{k-1}$.
- If $p$ and $q$ are distinct prime numbers then $\phi (pq) = \phi (p) \phi (q)$.
We will now look at some more examples of computing $\phi(n)$ for various $n$.
Example 1
Calculate $\phi (23291)$.
The prime power decomposition of $23292$ is $23292 = 2^2 \cdot 3^2 \cdot 647$. Hence it follows that:
(1)Example 2
Calculate $\phi (62292)$.
The prime power decomposition of $62292$ is $62292 = 2^2 \cdot 3 \cdot 29 \cdot 179$. Hence it follows that:
(2)Example 3
Calculate $\phi (432432)$.
The prime power decomposition of $432432$ is $432432 = 2^4 \cdot 3^3 \cdot 7 \cdot 11 \cdot 13$. Hence it follows that:
(3)Example 4
Calculate $\phi (6824000)$.
The prime power decomposition of $6824000$ is $6824000 = 2^6 \cdot 5^3 \cdot 853$. Hence it follows that:
(4)Example 5
Calculate $\phi (9999990)$.
The prime power decomposition of $9999990$ is $9999990 = 2 \cdot 3^3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 37$. Hence it follows that:
(5)