Ask a New Question
Search
Prove that for n greater than or equal to 3, there are no primitive roots modulo 2^n.
there is a step that has a^2^n-2 = 1 (mod 2^n) but I don't understand why -2??
Ask a New Question
or
answer this question
.