Results 1 to 2 of 2

Math Help - Primitive Roots - Show that k is odd?

  1. #1
    Newbie
    Joined
    Oct 2012
    From
    District of Columbia
    Posts
    16

    Primitive Roots - Show that k is odd?

    If g and h are primitive roots of an odd prime p, then g is congruent to hk (mod p) for some integer k. Show that k is odd.

    Suppose g and h are primitive roots of an odd prime p. This means that gi is congruent to a (mod p) and hj is congruent to b (mod p) with gcd(i,p) = 1 and gcd(j,p)=1.
    We also know that g is congruent to hk (mod p).

    I am not sure if I need to manipulate this to show that k is of the form 2m+1 or what. Any advice would be helpful.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member
    Joined
    Dec 2012
    From
    Athens, OH, USA
    Posts
    537
    Thanks
    216

    Re: Primitive Roots - Show that k is odd?

    In any group G, if x has order n, then x^k has order n/gcd(n,k). (If you need help with this, let me know.) In particular, x^k has order n iff (n,k) = 1. So for your problem, the group G is the multiplicative group of integers mod p, of order p-1. Then assuming g has order p-1, g^k has order p-1 iff (k,p-1)=1. So since p-1 is even, k must be odd.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. primitive roots
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 17th 2012, 04:33 AM
  2. [SOLVED] Primitive roots
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: July 10th 2011, 05:15 PM
  3. x^7 = 12 mod 29 (primitive roots)
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 23rd 2010, 06:57 PM
  4. Primitive Roots
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: November 17th 2008, 08:09 PM
  5. Primitive roots
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: September 11th 2008, 04:53 PM

Search Tags


/mathhelpforum @mathhelpforum