Euler’s Totient Function

Totient function (denoted by $\varphi :\mathbb{N}\to \mathbb{N}$ ), also known as phi-function or Euler’s Totient function, is a mathematical function which counts the number of integers in the range $[1,n]$ (both inclusive) that are co-prime to $n$ or we can say whose GCD with n is 1.

Note:

1. 2 positive integers a and b are said to be co-prime if their greatest common factor/divisor is equal to 1, that is,

$$gcd(a,b)=1$$

2. $1$ is considered co-prime to all numbers.

Example of Euler's Totient Function

Example 1

For an small example, let’s take $n=10$.

The numbers less than 10 are as follows:

$$1,2,3,4,5,6,7,8,9$$

Out of these,

• 1 is co-prime to 10 (by definition).
• 2 and 5 completely divide 10, therefore, are not co-prime to 10.
• 4, 6, 8 are divisible by 2 (just like 10), therefore, their greatest common divisor is 2. Therefore, they are also not coprime to 10..
• 3, 7, 9 neither divide 10 nor share any common factor with it. Therefore, by definition of coprime numbers, we saw earlier, these numbers are coprime to 10.

Therefore, there are 4 numbers less than 10 that are co-prime to it. These are

$$1,3,7,9$$

Therefore,

$$\varphi (10)=4$$

Example 2

Let’s take a bigger n, say 24.

In range [1,24] there are total 8 numbers 1,5,7,11,13,17,19,23 are there whose gcd with 24 is equal to 1 (they are coprime to it). Therefore:
$$\varphi (n)=8$$

How to Compute Φ(n) for an Input n?

Suppose you’re given an integer $n\in \mathbb{N}$. Using the fundamental theorem of arithmetic, we know that $n$ can be decomposed as a product of the positive integral powers of its prime factors. Therefore,

(1):
$$n=p_1^{{\alpha }_1}\cdot p_2^{{\alpha }_2}\cdots p_k^{{\alpha }_k}$$

where $p_i$ are prime factors of $n$.

Now using an interesting property of the totient function, which states that

(2):

$$\varphi (abc)=\varphi a\cdot \varphi (b)\cdot \varphi (c)$$

provided that $a,b,c$ are co-prime to each other.

Using $(1)$ and $(2)$, we get

(3):
$$\varphi (n)=\varphi (p_1^{{\alpha }_1}\cdot p_2^{{\alpha }_2}\cdots p_k^{{\alpha }_k})=\varphi (p_1^{{\alpha }_1})\cdot \varphi (p_2^{{\alpha }_2})\cdots \varphi (p_k^{{\alpha }_k})$$

Another interesting property of the totient function $\varphi (m)$ is that if $m$ is a power of a prime number, say $p^{\alpha }$ where $\alpha \ge 1$, then,

(4):
$$\varphi (m)=\varphi (p^{\alpha })=p^{\alpha }-p^{\alpha -1}$$

Using $(4)$ and $(3)$, we get

(5):
$$\varphi (n)=(p_1^{{\alpha }_1}-p_1^{{\alpha }_1-1})\cdot (p_2^{{\alpha }_2}-p_2^{{\alpha }_2-1})\cdot (p_3^{{\alpha }_3}-p_3^{{\alpha }_3-1})\cdots (p_k^{{\alpha }_k}-p_k^{{\alpha }_k-1})$$

Taking $p_i^{{\alpha }_i}$ common from $i^{th}$ term from RHS of $(5)$, we get

$$=p_1^{{\alpha }_1}\cdot p_2^{{\alpha }_2}\cdots p_k^{{\alpha }_k}\cdot \left(1–\frac{1}{p_1}\right)\cdot \left(1–\frac{1}{p_2}\right)\cdots \left(1–\frac{1}{p_k}\right)$$

$$=n\cdot \left(1–\frac{1}{p_1}\right)\cdot \left(1–\frac{1}{p_2}\right)\cdots \left(1–\frac{1}{p_k}\right)$$

Hence we get
$$\varphi (n)=n\cdot \left(1–\frac{1}{p_1}\right)\cdot \left(1–\frac{1}{p_2}\right)\cdots \left(1–\frac{1}{p_k}\right)$$

The above equation gives us a method to calculate $\varphi (n)$ for any desired $n$.

Code Implementation

Using the result we derived above, it is quite easy to write a program to calculate $\varphi (n)$ for an input $n$.

C++ Implementation 1

long long phi(long long n) 
{
    long long answer = n;

    for (long long p = 2; p * p <= n; p++) 
    {
        if (n % p == 0) 
        {
            while (n % p == 0)
            {
                n = n/p;
            }
            answer = answer-(answer / p);
        }
    }

    if (n > 1)
    {
        answer = answer-(answer / n);
    }
    return answer;
}

Explanation:

The algorithm initializes answer with n and iterates through primes up to the square root of n, dividing n by each prime divisor found. It updates answer by multiplying it with (1 – 1/p), ensuring accuracy. If n remains greater than 1 after this process, it accounts for the last prime factor of n. This optimized approach efficiently calculates Euler’s Totient function, addressing precision errors by using multiplication instead of division.

Time Complexity: $\mathcal{O}(\sqrt{n})$

Space Complexity: $\mathcal{O}(1)$

C++ Implementation 2

vector<long long> phi_n(long long n) 
{
    vector<long long> phi(n + 1);

    phi[0] = 0;
    phi[1] = 1;

    for (long long i = 2; i <= n; i++)
    {
        phi[i] = i;
    }

    for (int i = 2; i <= n; i++) 
    {
        if (phi[i] == i) 
        {
            for (int j = i; j <= n; j += i)
            {
                phi[j] -= phi[j] / i;
            }
        }
    }

    return phi;
}

Explanation:
This optimized implementation efficiently computes Euler’s totient function ($\varphi$) for all integers up to $n$ using the Sieve of Eratosthenes. Rather than factorizing each number individually, it iterates through primes and updates their multiples by subtracting $\varphi [j]/i$. For prime numbers, it subtracts 1. This approach ensures efficiency by avoiding redundant computations.

Time Complexity: $\mathcal{O}(n\log (\log n))$

Space Complexity: $\mathcal{O}(n)$

C++ Implementation 3 (Using Divisor Sum Property)

vector<long long> phi_n(long long n) 
{
    vector<long long> phi(n + 1);
    phi[0] = 0;
    phi[1] = 1;
    for (long long i = 2; i <= n; i++)
    {
        phi[i] = i - 1;
    }

    for (long long i = 2; i <= n; i++)
    {
        for (long long j = 2 * i; j <= n; j += i)
        {
              phi[j] -= phi[i];
        }
    }

    return phi;
}

Explanation:
This implementation leverages the divisor sum property of the totient function. Initially, subtracting ϕ(1) from all numbers, the ith element of the phi vector initializes as i-1. When processing element i, previous phi values remain unchanged. Subsequently, phi[i] subtracts from multiples of i starting from 2*i up to n. Upon completion, the phi array holds the ϕ values for numbers 1 to n. This optimized approach efficiently computes totient values, exploiting the properties of integer factorization.

Time Complexity: $\mathcal{O}(n\log (n))$

Space Complexity: $\mathcal{O}(n)$

Properties of Euler's Totient Function

In addition to the above-used properties, we also have the following results related to the Totient function:

1. If $p$ is a prime number, then
   $$\varphi (p)=p-1$$
2. If $p$ is a prime number and $m$ is a positive integer (that is, $m\ge 1$), then
   $$\varphi (p^m)=p^m-p^{m-1}$$
3. For any two positive integers $m$ and $n$ we have
   $$\varphi (mn)=\varphi (m)\cdot \varphi (n)\cdot \frac{gcd(m,n)}{\varphi (gcd(m,n))}$$ Considering the case when $m$ and $n$ are coprime, then $gcd(m,n)=1$. In such a scenario, the above relation reduces to
   $$\varphi (mn)=\varphi (m)\cdot \varphi (n)$$
4. The sum of values of the totient function over the positive divisors of $n$ equals $n$ itself. In other words:
   $$\sum _{k|n}\varphi (k)=n$$
5. If $m$ and $n$ are two prime numbers, then using (1) and (3), we get:
   $$\varphi (mn)=\varphi (m)\cdot \varphi (n)=(m-1)\cdot (n-1)$$ This property is used in the RSA algorithm.

Application of Totient Function in Euler's Theorem

Euler's theorem (sometimes also called as Euler’s totient theorem) which makes use of Euler’s totient function, states the following:

If $a$, $n$ $\in \mathbb{N}$ are relatively prime, then
$$a^{\varphi (n)}\equiv 1\mathrm{mod}n$$

The converse of the Euler's theorem also holds, which is stated as:

If $a^{\varphi (n)}\equiv 1\mathrm{mod}n$, then $a$ and $n$ are relatively prime.

A special case of this theorem where $n$ is a prime number is used in the RSA encryption algorithm. This special case of the theorem is popularly known as Fermat's Little Theorem and states that

$a^{n-1}\equiv 1\mathrm{mod}n$

Taking an example, suppose $a=10$ and $n=9$. Using the methods described above, we get $\varphi (9)=6$.

Therefore, $a^{\varphi (n)}={10}^6$.

Applying the $\mathrm{mod}n(=\mathrm{mod}9)$ operator on ${10}^6$, we get
$${10}^6\mathrm{mod}9=(11111\times 9+1)\mathrm{mod}9=0+(1\mathrm{mod}9)=1$$

which was the expected result since 10 and 9 don’t have any common divisor other than 1, that is to say, they are co-prime.

Suppose we had taken a number $n=2$ which is not co-prime to 10 (since their greatest common divisor is 2).

In this case, $\varphi (n)=\varphi (2)=1$.

Therefore, $a^{\varphi (n)}={10}^1=10$.

Applying the $\mathrm{mod}n(=\mathrm{mod}2)$ operator on $10$, we get
$$10\mathrm{mod}2=(5\times 2)\mathrm{mod}2=0\ne 1$$

Thus, we’ve verified that the theorem does not hold when $a$ and $n$ are not co-prime.

Conclusion

1. Euler's totient function, $\varphi :\mathbb{N}\to \mathbb{N}$, counts the number of integers between $1$ and $n$ (both inclusive) that are co-prime to $n$.
2. If $p$ is a prime number, then
   $$\varphi (p)=p-1$$
3. The sum of values of the totient function over the positive divisors of $n$ equals $n$ itself.
4. Totient Function is used in Euler’s theorem, Fermat’s Little theorem which is used in the RSA encryption algorithm.
5. The value of Totient function for a number $n$ can be implemented in the best time complexity of $\mathcal{O}(n\log (\log n))$ with an associated space complexity of $\mathcal{O}(n)$