Euler Totient for Competitive Programming Last Updated : 12 Mar, 2024 Comments Improve Suggest changes Like Article Like Report What is Euler Totient function(ETF)?Euler Totient Function or Phi-function for 'n', gives the count of integers in range '1' to 'n' that are co-prime to 'n'. It is denoted by \phi(n) .For example the below table shows the ETF value of first 15 positive integers: 3 Important Properties of Euler Totient Funtion:If p is prime number:\phi(p)=p-1 For n^k where n is a prime number and k is some positive integer:\phi(p^k)=p^k (1-1/p) If a and b are relatively prime\phi(ab)=\phi(a)*\phi(b) click here for proof Deducing equation to calcuate ETF for 'n' using above properties: \phi(n) = \phi_{}(p_{1}^{a_{1}} * p_{2}^{a_{2}} * p_{3}^{a_{3}} ... p_{k}^{a_{k}}) {prime factorizing n} \phi(n) = (p_{1}^{a_{1}}*(1-1/p_{1}) * p_{2}^{a_{2}}*(1-1/p_{2}) ... p_{k}^{a_{k}}*(1-1/p_{k}) ) \phi(n) = (p_{1}^{a_{1}} * p_{2}^{a_{2}}...*p_{k}^{a_{k}} * (1-1/p_{1})*(1-1/p_{2}) ... *(1-1/p_{k}) ) \phi(n) = n * (1-1/p_{1})*(1-1/p_{2}) ... *(1-1/p_{k}) Euler Totient Funtion in O(\sqrt{n} ) using prime factorization: C++ int ETF(int n) { int phi_n = n; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { while (n % i == 0) n /= i; phi_n -= phi_n / i; } } if (n > 1) phi_n -= phi_n / n; return result; } Java public class EulerTotientFunction { // Function to calculate Euler's Totient Function (ETF) for an integer n public static int ETF(int n) { int phi_n = n; // Initialize phi_n with the value of n // Iterate through potential prime factors up to the square root of n for (int i = 2; i * i <= n; i++) { if (n % i == 0) { // Found a prime factor i while (n % i == 0) { n /= i; // Reduce n by removing all factors of i } phi_n -= phi_n / i; // Update phi_n using the formula } } // If n is still greater than 1, it is a prime number if (n > 1) { phi_n -= phi_n / n; // Update phi_n for the remaining prime factor } return phi_n; // Return the Euler's Totient Function value for n } public static void main(String[] args) { int n = 10; // Replace with the desired value of n // Calculate Euler's Totient Function for n int result = ETF(n); // Print the result System.out.println("Euler's Totient Function value for " + n + " is: " + result); } } C# int ETF(int n) { int phi_n = n; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { while (n % i == 0) n /= i; phi_n -= phi_n / i; } } if (n > 1) phi_n -= phi_n / n; return phi_n; } JavaScript // Function to calculate Euler's Totient Function function ETF(n) { let phi_n = n; for (let i = 2; i * i <= n; i++) { if (n % i === 0) { while (n % i === 0) n /= i; phi_n -= phi_n / i; } } if (n > 1) phi_n -= phi_n / n; return phi_n; } // Example usage let n = 12; let result = ETF(n); console.log(`Euler's Totient Function for n = ${n}: ${result}`); Python3 def ETF(n): phi_n = n i = 2 while i * i <= n: if n % i == 0: while n % i == 0: n //= i phi_n -= phi_n // i i += 1 if n > 1: phi_n -= phi_n // n return phi_n How to store Euler Totient Function for each integer 1 to n Optimally:The above code shows that we can calculate the ETF value for 'n' in O(\sqrt{n} ), If we want to calculate ETF value for each integer from 1 to n then it will take us O(n\sqrt{n}) . Can we optimize this time complexity? YES we can, using precomputation similar to Sieve of Eratosthenes we can reduce the time complexity to O(n*log(log n)) as shown in below code: C++ vector<int> ETF_1_to_n(int n) { vector<int> phi(n + 1); for (int i = 0; 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 } Java List<Integer> ETF_1_to_n(int n) { List<Integer> phi = new ArrayList<>(n + 1); for (int i = 0; i <= n; i++) { phi.add(i); } for (int i = 2; i <= n; i++) { if (phi.get(i) == i) { for (int j = i; j <= n; j += i) { phi.set(j, phi.get(j) - phi.get(j) / i); } } } return phi; } C# List<int> ETF_1_to_n(int n) { List<int> phi = new List<int>(n + 1); for (int i = 0; i <= n; i++) phi.Add(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; } JavaScript function ETF_1_to_n(n) { const phi = new Array(n + 1).fill(0); for (let i = 0; i <= n; i++) { phi[i] = i; } for (let i = 2; i <= n; i++) { if (phi[i] === i) { for (let j = i; j <= n; j += i) { phi[j] -= Math.floor(phi[j] / i); } } } return phi; } Python3 def ETF_1_to_n(n): # Initialize a list phi containing numbers from 0 to n phi = list(range(n + 1)) # Calculate Euler's Totient Function for each number from 2 to n for i in range(2, n + 1): # If phi[i] is equal to i, indicating i is prime if phi[i] == i: # Update phi for multiples of i using Euler's Totient formula for j in range(i, n + 1, i): phi[j] -= phi[j] // i # phi[j] -= phi[j] / i, reducing by phi[j] # divided by i (floor division) return phi # Return the list containing Euler's Totient values from 1 to n Key hints to identify a problem uses the knowledge of Euler Totient Function:ETF is considered to be an advance topic for competitive programming which requires a good understanding of mathematics and its problem difficulty ranges from medium to hard. For a problem we can try to think towards ETF in the following scenarios: GCD and LCM based problemsUse of Chinese Remainder Theorem Use of Fermat's Little TheoremProblem requires calcuation of Large Exponentiations such as {a^{b}}^{c} Note: It is not necessary that all the above type of problems can be solved using Euler Totient Function, we can try to think in ETF's direction if above jargons are used in the problem statement. Use-Case of Euler Totient Function in Competitive Programming: Calculating Large Exponential Value % mod:Euler's Totient Theorem states that if a and n are coprime (gcd(a, n) = 1), then a^{φ(n)} ≡ 1 (mod n) . This theorem is used to find the remainder of a number raised to a large power modulo n efficiently. Competitive programming problems often require solving such congruence relations. Calculating Co-Prime Pairs:You may encounter problems that require counting the number of pairs (a, b) such that 1 ≤ a, b ≤ n and gcd(a, b) = 1. The Euler Totient function can be used here to calculate \phi(n) and then determine the count of coprime pairs. Eulter Totient Function as DP-state:In dynamic programming (DP) problems, you might use \phi(n) as a state in your DP table when solving combinatorial or counting problems involving modular arithmetic. Practice Problems On Euler Totient:Medium:Euler Totient Count of non-co-prime pairs from the range [1, arr[i]] for every array element Generate an array having sum of Euler Totient Function of all elements equal to N Count all possible values of K less than Y such that GCD(X, Y) = GCD(X+K, Y) Count of integers up to N which are non divisors and non coprime with N Find the number of primitive roots modulo prime Compute power of power k times % m Primitive root of a prime number n modulo n Euler’s Totient function for all numbers smaller than or equal to n Count numbers up to N whose GCD with N is less than that number Count integers in a range which are divisible by their euler totient value Hard:Sum of GCD of all numbers upto N with N itself Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2 Queries to count the number of unordered co-prime pairs from 1 to N Minimum insertions to make a Co-prime array Optimized Euler Totient Function for Multiple Evaluations Number Theory | Generators of finite cyclic group under addition Sum of Euler Totient Functions obtained for each divisor of N Count number of pairs (i, j) up to N that can be made equal on multiplying with a pair from the range [1, N / 2] Count of numbers up to N having at least one prime factor common with N Probability of Euler’s Totient Function in a range [L, R] to be divisible by M Count of Distinct strings possible by inserting K characters in the original string Count of elements having Euler’s Totient value one less than itself Count of pairs upto N such whose LCM is not equal to their product for Q queries Count of numbers upto M with GCD equals to K when paired with M Highly Totient Number Comment More infoAdvertise with us Next Article Euler's Totient Function V vaibhav_gfg Follow Improve Article Tags : Mathematical DSA euler-totient Practice Tags : Mathematical Similar Reads Euler Totient for Competitive Programming What is Euler Totient function(ETF)?Euler Totient Function or Phi-function for 'n', gives the count of integers in range '1' to 'n' that are co-prime to 'n'. It is denoted by \phi(n) .For example the below table shows the ETF value of first 15 positive integers: 3 Important Properties of Euler Totie 8 min read Euler's Totient Function Given an integer n, find the value of Euler's Totient Function, denoted as Φ(n). The function Φ(n) represents the count of positive integers less than or equal to n that are relatively prime to n. Euler's Totient function Φ(n) for an input n is the count of numbers in {1, 2, 3, ..., n-1} that are re 10 min read Count of non co-prime pairs from the range [1, arr[i]] for every array element Given an array arr[] consisting of N integers, the task for every ith element of the array is to find the number of non co-prime pairs from the range [1, arr[i]]. Examples: Input: N = 2, arr[] = {3, 4}Output: 2 4Explanation: All non-co-prime pairs from the range [1, 3] are (2, 2) and (3, 3).All non- 13 min read Generate an array having sum of Euler Totient Function of all elements equal to N Given a positive integer N, the task is to generate an array such that the sum of the Euler Totient Function of each element is equal to N. Examples: Input: N = 6Output: 1 6 2 3 Input: N = 12Output: 1 12 2 6 3 4 Approach: The given problem can be solved based on the divisor sum property of the Euler 5 min read Count all possible values of K less than Y such that GCD(X, Y) = GCD(X+K, Y) Given two integers X and Y, the task is to find the number of integers, K, such that gcd(X, Y) is equal to gcd(X+K, Y), where 0 < K <Y. Examples: Input: X = 3, Y = 15Output: 4Explanation: All possible values of K are {0, 3, 6, 9} for which GCD(X, Y) = GCD(X + K, Y). Input: X = 2, Y = 12Output: 8 min read Count of integers up to N which are non divisors and non coprime with N Given an integer N, the task is to find the count of all possible integers less than N satisfying the following properties: The number is not coprime with N i.e their GCD is greater than 1.The number is not a divisor of N. Examples: Input: N = 10 Output: 3 Explanation: All possible integers which ar 5 min read Find the number of primitive roots modulo prime Given a prime p . The task is to count all the primitive roots of p .A primitive root is an integer x (1 <= x < p) such that none of the integers x - 1, x2 - 1, ...., xp - 2 - 1 are divisible by p but xp - 1 - 1 is divisible by p . Examples: Input: P = 3 Output: 1 The only primitive root modul 5 min read Compute power of power k times % m Given x, k and m. Compute (xxxx...k)%m, x is in power k times. Given x is always prime and m is greater than x. Examples: Input : 2 3 3 Output : 1 Explanation : ((2 ^ 2) ^ 2) % 3 = (4 ^ 2) % 3 = 1 Input : 3 2 3 Output : 0 Explanation : (3^3)%3 = 0 A naive approach is to compute the power of x k time 15+ min read Primitive root of a prime number n modulo n Given a prime number n, the task is to find its primitive root under modulo n. The primitive root of a prime number n is an integer r between[1, n-1] such that the values of r^x(mod n) where x is in the range[0, n-2] are different. Return -1 if n is a non-prime number. Examples: Input : 7 Output : S 15 min read Euler's Totient function for all numbers smaller than or equal to n Euler's Totient function ?(n) for an input n is the count of numbers in {1, 2, 3, ..., n} that are relatively prime to n, i.e., the numbers whose GCD (Greatest Common Divisor) with n is 1. For example, ?(4) = 2, ?(3) = 2 and ?(5) = 4. There are 2 numbers smaller or equal to 4 that are relatively pri 13 min read Like