Primitive Roots

  • Thread starter Gear300
  • Start date
  • #1
1,187
5
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
15,536
13,634
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
1,187
5
Indeed. I'm guessing yours is how it's done, since it seems like the original could be semantically interpreted like that. Thanks.
 
  • #4
35,285
7,126
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...
 

Related Threads on Primitive Roots

  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
9
Views
5K
  • Last Post
Replies
8
Views
2K
  • Last Post
Replies
14
Views
1K
  • Last Post
Replies
17
Views
2K
  • Last Post
Replies
5
Views
7K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
2
Views
874
  • Last Post
Replies
5
Views
1K
Top