Thursday, January 20, 2011

Euler's_totient_function

How many numbers x smaller than a have have a greatest common divisor gcd(x,a) = 1? This is
known as Euler's totient function

Primes strike out to the diagonal:
alt : It seems your browser does not support SVG. Consider using Google Chrome or another SVG enabled browser, I don'know why this fails in IE....

No comments:

Post a Comment