Proof of Eulers theorem

Eulers Theorem: Let a, n be positive integers such that GCD(a, n) = 1. Then a(n) 1 (mod
n)
Proof of Eulers Theorem: Consider two sets of integers S and T, defined as below:
S = {x1 , x2 , . . ., x(n) }, the set of all integers that have a GCD of 1 with n (there are (n)
such integers, by definition).
T = {ax1 %n, ax2 %n, . . ., ax(n) %n}.
Lemma: S = T.
Proof of Lemma: Proof by contradiction. Suppose S6=T. First note that all the elements in T
are positive integers less than n. Also, since GCD(a, n) = 1 and GCD(xi , n) = 1, we have that
GCD(axi , n) = 1 and that GCD(axi %n) = 1. Thus, each one of the elements in T is also an
element of S.
So the only way that we can have S6=T is if there are some two elements axi %n, axj %n, i6=j
of T, such that axi %n = axj %n. This would imply that axi %n axj %n (mod n). Since axi %n
axi (mod n) and axj %n axj (mod n), axi axj (mod n).
But if this is the case, then a(xi - xj ) 0 (mod n). Since GCD(a, n) = 1, this means that n
divides xi - xj , which is impossible since both xi and xj are less than n. Thus, S = T.
Since S = T, we can multiply all the elements in these sets, and the products should be the
same, i.e., S = T, where:
S = x1 .x2 . . .x(n) .
T = ax1 %n.ax2 %n. . .ax(n) %n.
But axi %naxi (mod n), so T a(n) x1 x2 . . .x(n) (mod n). So we have, x1 .x2 . . .x(n)
1 x2 . . .x(n) (mod n).
But we know that GCD(x1 x2 . . .x(n) , n) = 1, so we have 1 a(n) (mod n)


a(n) x