Life of Phi

Limits 1s, 512 MB

The Great Khami is learning Number Theory. He is very excited to know that Euler’s Totient Function is very useful in Cryptography. Euler’s Totient function, also known as the Phi function is defined over all positive integers. For each input value n, the function returns the number of co-primes with n that are less than n. Two numbers are said to be co-primes if their greatest common divisor is 1. Khami started exploring different properties of Euler’s Totient function. He became fascinated with one property of this function, it states:


This is a companion discussion topic for the original entry at https://toph.co/p/life-of-phi