# Euler's Totient Theorem

✅ Paper Type: Free Essay |
✅ Subject: Mathematics |

✅ Wordcount: 2086 words |
✅ Published: 8th Sep 2017 |

**Summary **

Euler Totient theorem is a generalized form of Fermat’s Little theory. As such, it solely depends on Fermat’s Little Theorem as indicated in Euler’s study in 1763 and, later in 1883, the theorem was named after him by J. J. Sylvester. According to Sylvester, the theorem is basically about the alteration in similarity. The term “Totient” was derived from “Quotient”, hence, the function deals with division, but in a unique way. In this manner, The Euler’s Totient function Ï† for any integer (*n*) can be demarcated, as the figure of positive integers is not greater than and co-prime to *n*.

a^{Ï†(n)} = 1 (mod n)

Based on Leonhard Euler’s contributions toward the development of this theorem, the theory was named after him despite the fact that it was a generalization of Fermat’s Little Theory in which *n* is identified to be prime. Based on this fact, some scholarly source refers to this theorem as the Fermat’s-Euler theorem of Euler’s generalization.

**Introduction**

I first developed an interest in Euler when I was completing a listener crossword; the concealed message read “Euler was the master of the crossword.” When I first saw the inclusion of the name “Euler” on the list of prompt words, I had no option but to just go for it. Euler was a famous mathematician in the eighteenth century, who was acknowledged for his contribution in the mathematics discipline, as he was responsible for proving numerous problems and conjectures. Taking the number theory as an example, Euler successively played a vital role in proving the two-square theorem as well as the Fermat’s little theorem (Griffiths and Peter 81). His contribution also paved the way to proving the four-square theorem. Therefore, in this course project, I am going to focus on his theory, which is not known to many; it is a generalization of Fermat’s little theorem that is commonly known as Euler’s theorem.

**Theorem**

Euler’s Totient theorem holds that if *a* and *n* are coprime positive integers, then since Î¦_{n} is a Euler’s Totient function.

**Euler’s Totient Function**

Euler’s Totient Function (Î¦_{n}) is the count of positive integers that are less that *n* and relatively prime to *n.* For instance, Î¦_{10} is 4, since there are four integers, which are less than 10 and are relatively prime to 10: 1, 3, 7, 9. Consequently, Î¦_{11} is 10, since there 11 prime numbers which are less than 10 and are relatively prime to 10. The same way, Î¦_{6} is 2 as 1 and 5 are relatively prime to 6, but 2, 3, and 4 are not.

The following table represents the totients of numbers up to twenty.

N |
Î¦ |

2 |
1 |

3 |
2 |

4 |
2 |

5 |
4 |

6 |
2 |

7 |
6 |

8 |
4 |

9 |
6 |

10 |
4 |

11 |
10 |

12 |
4 |

13 |
12 |

14 |
6 |

15 |
8 |

16 |
8 |

17 |
16 |

18 |
6 |

19 |
18 |

20 |
8 |

Some of these examples seek to prove Euler’s totient theorem.

Let *n* = 10 and *a* = 3. In this case, 10 and 3 are co-prime i.e. relatively prime. Using the provided table, it is clear that Î¦10 = 4. Then this relation can also be represented as follows:

3^{4} = 81 â‰¡ 1 (mode 10). Conversely, if *n* = 15 and *a* = 2, it is clear that 2^{8} = 256 â‰¡ 1 (mod 15).

**Fermat’s Little Theory**

According to Liskov (221), Euler’s Totient theorem is a simplification of Fermat’s little theorem and works with every *n* that are relatively prime to *a*. Fermat’s little theorem only works for *a* and *p* that are relatively prime.

a ^{p-1} â‰¡ 1 (mod p)

or

a ^{p} â‰¡ a (mod p)

where *p* itself is prime.

It is, therefore, clear that this equation fits in the Euler’s Totient theorem for every prime *p,* as indicated in Î¦_{p}, where *p* is a prime and is given by *p-1*.

Therefore, to prove Euler’s theorem, it is vital to first prove Fermat’s little theorem.

**Proof to Fermat’s Little ****Theorem**

As earlier indicated, the Fermat’s little theorem can be expressed as follows:

a^{p} â‰¡ a (mod p)

taking two numbers: *a* and *p*, that are relatively prime, where *p* is also prime.

The set of *a* {a, 2a, 3a, 4a, 5aâ€¦(p-1)a}â€¦â€¦â€¦(i)

Consider another set of number {1, 2, 3, 4, 5â€¦.(p-1a)}â€¦â€¦(ii)

If one decides to take the modulus for *p*, each element of the set (i) will be congruent to an item in the second set (ii). Therefore, there will be one on one correspondence between the two sets. This can be proven as lemma 1.

Consequently, if one decides to take the product of the first set, that is {a x 2a x 3a x 4a x 5a x â€¦. (p-1)a } as well as the product of the second set as {1 x 2 x 3 x 4 x 5â€¦ (p-1)}. It is clear that both of these sets are congruent to one another; that is, each element in the first set matches another element in the second set (Liskov 221).

Therefore, the two sets can be represented as follows:

{a x 2a x 3a x 4a x 5a x â€¦. (p-1)a } â‰¡ {1 x 2 x 3 x 4 x 5â€¦ (p-1)} (mode *p*).

If one takes out the factor a ^{p-1} from the left-hand side (L.H.S), the resultant equation will be A^{p-1 }{a x 2a x 3a x 4a x 5a x â€¦. (p-1)a } â‰¡ {1 x 2 x 3 x 4 x 5â€¦ (p-1)} (mode *p*).

If the same equation is divided by {1 x 2 x 3 x 4 x 5â€¦ (p-1)} when *p* is prime, one will obtain

a ^{p} â‰¡ a (mod p)

or

a ^{p-1} â‰¡ 1 (mod p)

It should be clear that each element in the first set should correspond to another element in the second set (elements of the set are congruent). Even though this is not obvious at the first step, it can still be proved through three logical steps as follows:

- Each element in the first set should be congruent to one element in the second set; this implies that none of the elements will be congruent to 0, as
*p*and*a*are relatively prime. - No two numbers in the first set can be labeled as
*ba*or*ca*. If this is done, some elements in the first set can be the same as those in the second set. This would imply that two numbers are congruent to each other i.e. ba â‰¡ ca (mod p), which would mean that b â‰¡ c (mod p) which is not true mathematically, since both the element are divergent and less than*p*. - An element in the first set can not be congruent to two numbers in the second set, since a number can only be congruent to numbers that differ by multiple of
*p*.

Through these three rules, one can prove Fermat’s Little Theorem.

**Proof ****of**** Euler’s Totient T****heorem**

Since the Fermat’s little theorem is a special form of Euler’s Totient theorem, it follows that the two proofs provided earlier in this exploration are similar, but slight adjustments need to be made to Fermat’s little theorem to justify Euler’s Totient theorem (KrÌŒiÌzÌŒek 97). This can be done by using the equation

a ^{Î¦n} â‰¡ 1 (mod n)

where the two numbers, *a* and *n*, are relatively prime, with the set of figures *N*, which are relatively prime to n {1, n_{1}. n_{2}â€¦.n _{Î¦n} }. This set is likely to have Î¦n element, which is defined by the number of the relatively prime number to *n*. In the same way, in the second set *aN*, each and every element is a product of *a* as well as an element of *N* {a, an_{1}, an_{2}, an_{3}â€¦an_{Î¦n}}.

Each element of the set *aN* must be congruent to another element in the set *N* (mode n) as noted by the earlier three rules. Therefore, each element of the two sets will be congruent to each other (Giblin 111).

In this scenario case, it can be said that:

{a x an_{1} x an_{2} x an_{3} x â€¦. an _{Î¦n} } â‰¡ {a xÂ n_{1} x n_{2} x n_{3} x â€¦.n _{Î¦n} } (mod n).

By factoring out *a* and *a** ^{Î¦n}* from the left-hand side, one can obtain the following equation

a ^{Î¦n }{1 x n_{1} x n_{2} x n_{3} x â€¦.n _{Î¦n}} â‰¡ {1 x n_{1} x n_{2} x n_{3} x â€¦.n _{Î¦n} } (mod n)

If this obtained equation is divided by {1 x n_{1} x n_{2} x n_{3} x â€¦.n _{Î¦n} } from both sides, all the elements in the two sets will be relatively prime. The obtained equation will be as follows:

a ^{Î¦n} â‰¡ 1 (mod n)

**Application of the Euler’s Theorem**

Unlike other Euler’s works in the number theory like the proof for the two-square theorem and the four-square theorem, the Euler’s totient theorem has real applications across the globe. The Euler’s totient theorem and Fermat’s little theorem are commonly used in decryption and encryption of data, especially in the RSA encryption systems, which protection resolves around big prime numbers (Wardlaw 97).

**Conclusion**

In summary, this theorem may not be Euler’s most well-designed piece of mathematics; my favorite theorem is the two-square theorem by infinite descent. Despite this, the theorem seems to be a crucial and important piece of work, especially for that time. The number theory is still regarded as the most useful theory in mathematics nowadays. Through this proof, I have had the opportunity to connect some of the work I have earlier done in discrete mathematics as well as sets relation and group options. Indeed, these two options seem to be among the purest sections of mathematics that I have ever studied in mathematics. However, this exploration has enabled me to explore the relationship between Euler’s totient theorem and Fermat’s little theorem. I have also applied knowledge from one discipline to the other which has broadened my view of mathematics.

Works Cited

Giblin, P J. Primes, and Programming: An Introduction to Number Theory with Computing. Cambridge UP, 1993. Print.

Griffiths, H B, and Peter J. Hilton. *A Comprehensive Textbook of Classical Mathematics: A Contemporary Interpretation*. London: Van Nostrand Reinhold Co, 1970. Print.

KrÌŒiÌzÌŒek, M., et al. 17 Lectures on Fermat Numbers: From Number Theory to Geometry. Springer, 2001. Print.

Liskov, Moses. “Fermat’s Little Theorem.” Encyclopedia of Cryptography and Security, pp. 221-221.

Wardlaw, William P. *Euler’s Theorem for Polynomials*. Ft. Belvoir: Defense Technical Information Center, 1990. Print.

## Cite This Work

To export a reference to this article please select a referencing stye below:

## Related Services

View all## DMCA / Removal Request

If you are the original writer of this essay and no longer wish to have your work published on UKEssays.com then please: