1) When a and n are not relatively prime, I guess I don't really understand why the equation ax-b may have no solutions or several solutions in Zn.
2) I guess it makes sense, since we use the Euclidean algorithm to find the inverse of a certain number mod(n), that we would also use that to prove that the inverse always exists. Simple enough, but when I first saw it I wasn't exactly sure as to how we would prove it.
No comments:
Post a Comment