Number Theory Problem

This problem is killing me and i dont know why, any help please

"prove that g is a primitive root modulo p (p an odd prime), then g
belongs to h modulo p^m, where h=(p-1)p^r for some r."
.

Relevant Pages

  • Re: eulers phi-function and divisibility by primes
    ... Is a case knwon that ... For any odd prime p, there are counterexamples (it will be true for ... primitive root modulo p^n for any odd prime p and any integer ...
    (sci.math)
  • Re: eulers phi-function and divisibility by primes
    ... Gottfried Helms wrote: ... Is a case knwon that ... For any odd prime p, there are counterexamples (it will be true for ... primitive root modulo p^n for any odd prime p and any integer ...
    (sci.math)
  • Re: Number Theory Problem
    ... "prove that g is a primitive root modulo p (p an odd prime), ... This newsgroup is for numerical analysis. ...
    (sci.math.num-analysis)
  • Re: primitive root question
    ... "If g is a primitive root modulo p, then g is also a primitive ... so if g is a primitive root modulo p (an odd prime), ... what I accept as reality." ... Arturo Magidin ...
    (sci.math)