15. Recall we denote by o(n) Euler's totient function, which counts the number of relatively prime numbers strictly less

[answerhappygod]

15 Recall We Denote By O N Euler S Totient Function Which Counts The Number Of Relatively Prime Numbers Strictly Less 1 (16.99 KiB) Viewed 30 times

15. Recall we denote by o(n) Euler's totient function, which counts the number of relatively prime numbers strictly less than n. Let G be a cyclic group of order n. Show that there are exactly o(n) generators of G. 16 Tot m Te where the mu ore distinct primer and onch 07