- #1
Gear300
- 1,213
- 9
Hello friends from afar.
I ran into what I felt to be somewhat of an odd question:
Prove that some odd numbers are primitive roots modulo pm for each odd prime p and each positive integer m.
It feels dodgy given that any odd number n = p1p2 ⋅⋅⋅ ps cannot be a primitive root of a prime number involved in its prime factorization. I just needed to be sure. Many thanks.
I ran into what I felt to be somewhat of an odd question:
Prove that some odd numbers are primitive roots modulo pm for each odd prime p and each positive integer m.
It feels dodgy given that any odd number n = p1p2 ⋅⋅⋅ ps cannot be a primitive root of a prime number involved in its prime factorization. I just needed to be sure. Many thanks.