Euler's totient function
Number of integers coprime to and less than n
Euler's totient function
In number theory, Euler's totient function counts the positive integers up to a given integer n {\displaystyle n} that are relatively prime to n {\displaystyle n} . It is written using the Greek letter phi as φ ( n ) {\displaystyle \varphi (n)} or ϕ ( n ) {\displaystyle \phi (n)} , and may also be called Euler's phi function. In other words, it is the number of integers k {\displaystyle k} in the range 1 ≤ k ≤ n {\displaystyle 1\leq k\leq n} for which the greatest common divisor gcd ( n , k ) {\displaystyle \gcd(n,k)} is equal to 1. The integers...
Read on Wikipedia · Image Pietro Battiston (it:User:Toobaz), CC BY-SA 4.0
Open boosters, collect cards and trade them. Free to play.
Play for free