Think twice

How many (incongruent) primitive roots are there modulo \(7^7\)?

Definition: An integer \(g\) is said to be a primitive root modulo \(n\) if every integer \(a\) coprime to \(n\) is congruent to a power of \(g\) modulo \(n\).

×

Problem Loading...

Note Loading...

Set Loading...