Show as a repeated decimal:
Show as a continued fraction:
Euler's totient (phi) function is an arithmetic function that counts the positive integers less than or equal to a given value, , that are coprime to . The PrimeCounting (or pi) command returns the number of primes less than an integer, .
Comparing pi(n) with phi(n) for the first forty values for n:
Two integers are relatively prime (coprime) if the greatest common divisor of the values is 1. The following plot shows the coprimes for the integers 1 to 25: