Prove that the equation ax ay (mod n) implies x y (mod n) whenever gcd

Question:

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.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  answer-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: