In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. It is written using the Greek letter phi as phi (n)}, and may also be called Euler's phi function.

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.

Euler’s Totient function Φ (n) is used in Euler’s theorem to find remainders .

Solution @

https://replit.com/@FlintelZugzwang/TotientNumber#main.py

Interested in Coding classes please join ZugZwang Academy.

For More Updates Subscribe to Algothink by Bharat Divyang (IIT/IIM).