Share
Explore BrainMass

Theory of Numbers - Primitive Root

Assume that n is odd and a is a primitive root mod n. Let b be an integer with b ≡ a(mod n) and gcd (b, 2n) =1. Show that b is a primitive root mod 2n.

Attachments

Solution Summary

Solution involves a result concerning primitive root.

$2.19