MathCastle
Number TheoryEasyFermat, Euler and Wilson

Fermat, Euler and Wilson · Easy problem

Euler's totient φ(n)\varphi(n) counts the integers from 11 to nn that are relatively prime to nn. Compute φ(27)\varphi(27).