Question: Prove that the equation ax ay (mod n) implies x y (mod n) whenever gcd (a, n) = 1. Show that the condition
Prove that the equation ax ≡ ay (mod n) implies x ≡ y (mod n) whenever gcd (a, n) = 1. Show that the condition gcd (a, n) = 1 is necessary by supplying a counterexample with gcd (a, n) > 1.
Step by Step Solution
3.48 Rating (158 Votes )
There are 3 Steps involved in it
To prove the statement we need to establish that if ax equiv ay pmodn and gcda n 1 then it must foll... View full answer
Get step-by-step solutions from verified subject matter experts
