Hi all,
Supppose that n > 0 and 0 < x < n are integers and x is relatively prime to n, show that there is an integer y with the property:
x*y is congruent to 1 (mod n)
I have attempted the following, I am not sure if I am on the right track:
1 = xy + qn which implies 1 - xy = qn
n|(1-xy)...