Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Euler's theorem
Summary
In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that, if n and a are coprime positive integers, and is Euler's totient function, then a raised to the power is congruent to 1 modulo n; that is
In 1736, Leonhard Euler published a proof of Fermat's little theorem (stated by Fermat without proof), which is the restriction of Euler's theorem to the case where n is a prime number. Subsequently, Euler presented other proofs of the theorem, culminating with his paper of 1763, in which he proved a generalization to the case where n is not prime.
The converse of Euler's theorem is also true: if the above congruence is true, then and must be coprime.
The theorem is further generalized by Carmichael's theorem.
The theorem may be used to easily reduce large powers modulo . For example, consider finding the ones place decimal digit of , i.e. . The integers 7 and 10 are coprime, and . So Euler's theorem yields , and we get .
In general, when reducing a power of modulo (where and are coprime), one needs to work modulo in the exponent of :
if , then .
Euler's theorem underlies the RSA cryptosystem, which is widely used in Internet communications. In this cryptosystem, Euler's theorem is used with n being a product of two large prime numbers, and the security of the system is based on the difficulty of factoring such an integer.
- Euler's theorem can be proven using concepts from the theory of groups: The residue classes modulo n that are coprime to n form a group under multiplication (see the article Multiplicative group of integers modulo n for details). The order of that group is φ(n). Lagrange's theorem states that the order of any subgroup of a finite group divides the order of the entire group, in this case φ(n). If a is any number coprime to n then a is in one of these residue classes, and its powers a, a^2, ... , a^k modulo n form a subgroup of the group of residue classes, with a^k ≡ 1 (mod n). Lagrange's theorem says k must divide φ(n), i.e.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.