Primitive Roots

  • Thread starter Gear300
  • Start date
  • #1
Gear300
1,204
8
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.
 

Answers and Replies

  • #2
fresh_42
Mentor
Insights Author
2021 Award
17,607
18,183
The wording is quite disturbing and I stumbled upon the same argument as you. "some odd numbers" looks strange.
It would make more sense the other way around (or I didn't get the point either):

For each odd prime ##p## and each positive integer ##m## prove that some odd numbers are primitive roots modulo ##p^m.##
 
  • #3
Gear300
1,204
8
Indeed. I'm guessing yours is how it's done, since it seems like the original could be semantically interpreted like that. Thanks.
 
  • #4
36,490
8,458
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.
In future posts, please don't delete the homework template...
 

Suggested for: Primitive Roots

  • Last Post
Replies
13
Views
368
Replies
4
Views
128
  • Last Post
Replies
4
Views
732
Replies
17
Views
336
Replies
10
Views
660
Replies
6
Views
900
  • Last Post
Replies
7
Views
473
  • Last Post
Replies
1
Views
961
Replies
1
Views
813
Top