Euler's Theorem
Definition (Euler's φ-Function) For each integer
let
denote the number of positive integers less than
and relatively prime to
and let
The function
is called the Euler's
-function, or sometimes the totient function.
Definition (Reduced Residue System) A reduced residue system modulo n is a set of
integers such that each element of the set is relatively prime to
and no two different elements of the set are congruent modulo
Example (Reduced Residue System) Find a reduced reside system modulo, 13, 12, and 28. Also find three distinct sets which are all reduced residue systems modulo 28.
Solution. The set
is a reduced residue system modulo 13. The set
is a reduced residue system modulo 12. The set
is a reduced residue system modulo 28. The set
is also a reduced residue set modulo 28. Finally, the set
![]()
is also a reduced residue set modulo 28.
![]()
Proposition (Reduced Residue System) If
is a reduced residue system modulo
and
then
is also a reduced residue system modulo
Moreover, the numbers
are congruent to the numbers
modulo
in some order.
Proof. We need to show that
for each
and
for all
If
and
then
because
But
can not happen because
is a reduced residue system modulo
. Suppose
and that
is a prime divisor of
Since
we can not have
because
Therefore,
and
By Euclid's lemma
Clearly,
and
contradict
and so there is no prime divisor of
for any
Therefore,
is also a reduced residue system modulo
Proposition (Euler's Theorem) If
then
Proof. Let
denote the reduced residue system modulo
consisting of positive integers not less than
We know that
is also a reduced residue system modulo
Moreover, the numbers
are congruent to the numbers
modulo
in some order. So
Since
we divide by
to obtain
Example (Euler's Theorem) Show that
![]()
Solution. A reduced residue system modulo 16 is
and so is
Therefore, they have the same least positive residue modulo 16. Hence,
Since
we divide by
to obtain
Proposition (Euler's Theorem Solves Linear Congruence Equation) The solution to the linear congruence
is
provided
![]()
Proof. If
then by Euler's theorem
and so multiplying by
we have
and so
is a solution.
![]()
Example (Euler's Theorem Solves Linear Congruence Equation) Solve the linear congruence
Solution. The solution is
where
and
. Thus,
![]()
Example (Finding Digits with Euler's Theorem) Find the last digit of the decimal expansion of
Solution. Since
and
by Euler's Theorem we have,
.
So the last digit in the expansion of
is 1 and thus the last digit in the expansion of
is of course 2.
Since
and
by Euler's Theorem we have,
.
So the last digit in the expansion of
is 7 and thus the last digit in the expansion of
is of course 9. Since the sum of integers with last digit of 2 and last digit of 9 is 1, the last digit of
is a 1.
![]()
Euler Theorem
Published by Library of Math -- Online math organized by subject into topics.
Written by Smith, David A.
http://www.libraryofmath.com/euler-theorem.html


