Ring of integers modulo n

jessica098

New member
Joined
Oct 20, 2008
Messages
15
I'm having a rough time with the following proofs, and was wondering if anybody could help me out?!

1. Assume that d=gcd(a, n)=1. Determine the number of solutions of the equation [a]x= in Zn. State a proposition and prove it.

2. Assume that d=gcd(a, n) divides the integer b. Prove that the equation [a]x= in Zn has at least one solution in Zn.

3. Make a conjecture about the number of solutions of the equation [a]x= in Zn when d divides b. Provide evidence of at least three equations to support your conjecture.
 
Top