2008年6月8日 · Primitive root modulo 121. Thread starter le_su14; Start date Jun 8, 2008; Tags 121 modulo primitive ...

2010年11月15日 · Hi, I have 3 problems concerning primitive roots that I have been unable to work through. Any advice on how to solve these would be greatly appreciated! 1. Show if g, h …

2010年3月21日 · In this case, 2 is a primitive root if and only if 2^{\frac{p-1}{2}}\equiv -1 \mod{p} . (Ask if you'd like to see the proof of this.) Assume otherwise, so 2^{\frac{p-1}{2}}\equiv 1 …

2010年4月23日 · Here p denotes a prime. Suppose q is a prime such that q=4n+1 where n is an interger. proof that 2 is a primitive root of p if p is of the form 2q+1. (sophie germain prime).

2009年11月19日 · Now i've worked out that 7 is a primitive root mod 22. And y=7 is a solution. But shouldn't there be 5 solutions? How do I find the rest? I have tried using the fact that because …

2008年8月22日 · Using the previous result, show that if n has a primitive root, then n has exactly \phi(\phi(n)) primitive roots. (Hint: Decide which powers of g give the primitive roots of n.) …

2011年3月7日 · I'm aware of the condition for k to such that g^k is a primitive root mod 13. In fact, I have shown that g^11 is a primitive root mod 13. But my question is how can I use this …

2008年5月6日 · Let r be a primitive root of the odd prime p . Prove the following. If p is congruent to 3(mod 4), then -r has order (p-1)/2 modulo p.

2011年3月15日 · Let p be a prime, show that the sum of all the primitive roots module p is congruent to u(p-1) module p.(Thinking)(Thinking)(Thinking) u is the mobius function. I am …

2007年12月13日 · let r be a primitive root of the integer n . prove that r^k is a primitive root of n if and only if gcd(k,phi(n))=1 for prime p>3 prove that the primitive root of p occur in pairs r,r' …