^{k}(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 g

^{i}is congruent to a (mod p) and h

^{j}is congruent to b (mod p) with gcd(i,p) = 1 and gcd(j,p)=1.

We also know that g is congruent to h

^{k}(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.