Number System and Arithmetic Algebra Set Theory Probability Statistics Geometry Calculus Logarithms Mensuration Matrices Trigonometry

Next Article: Euler's Theorem

Green's Theorem Last Updated : 15 Oct, 2024

Euler's Theorem states that for any integer a that is

coprime with a positive integer m, the remainder of a (m)

divided by m is 1. We focus on proving Euler's Theorem

because Fermat's Theorem is essentially a specific
instance of it. This relationship arises because when p is
a prime number, (p) equals p-1, thus making Fermat's
Theorem a subset of Euler's Theorem under these
conditions.

Euler's theorem is a fundamental result in number

theory, named after the Swiss mathematician Leonhard
Euler. It states a relationship between the number theory
functions and concepts of modular arithmetic. In this
article, we will discuss Euler's Theorem, including its
statement and proof.

Table of Content
What is Euler's Theorem?
Euler's Theorem Formula
Historical Background of Euler's Theorem
Proof of Euler's Theorem
Applications of Euler's Theorem
Euler’s Theorem Examples
Practice Questions on Euler's Theorem

What is Euler's Theorem?

Euler's Theorem is a fundamental concept in number
theory. It states that if n and a are coprime positive
integers, meaning that they have no mutual proper
dividers other than m = 1, then a (n) and 1 are relative
primes in modulo n.

Euler's Theorem is a generalization of Fermat's Little

Theorem and serves as a basis for simplifying complex
problems into computationally less expensive ones.

Euler's Theorem Statement

Euler's Theorem states if a and n are coprime positive

integers, then:

a (n) ≡≡ 1 (mod n)

where,

(n) is Euler's totient function, and

≡ denotes equivalence,
mod n represents congruence modulo n.

Euler's Totient Function

Formally, for a positive integer n, (n) is defined as

follows:

(n) = count of integers 1 ≤ a <n such that gcd

(a,n)=1

where: Private Vacation Rentals

gcd(a,n) denotes the greatest common divisor of a

and n.
(n) represents the totient function of n.

Euler's Theorem Formula

Statement of Euler's Theorem can be used as formula for
Book now
Book now
further calculations, i.e.,

(n)
a ≡≡ 1 (mod n)

Where,

a is any integer coprime to n

n is a positive integer
(n) is Euler's totient function Private Vacation Rentals

≡≡ denotes equivalence
mod n represents congruence modulo n
Book now Book now

Example Showing Euler's Theorem Formula

Problem: Verify Euler's Theorem for a = 3 and n = 8.

Solution:

First, we calculate (8). The numbers less than 8

that are coprime to 8 are 1, 3, 5, and 7. Thus,
(8)=4.
Next, calculate 34 and find its remainder when
divided by 8
34 = 81
Now, find 81 mod 8
81 mod 8 ≡ 1
Thus, 34 ≡ 1 (mod 8), which verifies Euler's
Theorem.

Historical Background of Euler's

Theorem
Euler's theorem is named after the Swiss mathematician
Leonhard Euler. Euler made numerous contributions to
various branches of mathematics during the 18th
century, and his work laid the groundwork for much of
modern mathematics. Euler's theorem specifically relates
to modular arithmetic and the concept of totient function.

The theorem itself is closely related to Euler's earlier

work on Fermat's Little Theorem. While Fermat's Little
Theorem states a special case of Euler's theorem, Euler's
theorem provides a more general formulation.

Proof of Euler's Theorem

Let φ(n) = k, and let {a1, . . . , ak} be a reduced
residue system mod n.
For some ai in {a1, . . . , ak}
Since (a, n) = 1, {aa1, . . . , aak} is another reduced
residue system mod n.
Since this is the same set of numbers mod n as the
original system, the two systems must have the
same product mod n:
(aa1)· · ·(aak) = a1 · · · ak (mod n)
ak (a1 · · · ak) = a1 · · · ak (mod n)
Now each ai is invertible mod n, so multiplying
both sides by a1−1 · · · ak−1 , We get
ak = 1 (mod n)
or aφ(n) = 1 (mod n).

Fermat's and Euler's Theorem

Euler's Theorem is generalization of fermat's theorem.
Here are the key differences between Fermat's and
Euler's Theorem:

Feature Fermat's Euler's Theorem

Little
Theorem

Conditions Applicable for any

Applicable
positive integer n
when p is
and a relatively
prime
prime to n

Statement If p is prime If n is a positive

and a is not integer and a is
divisible by p, relatively prime to
p−1 (n)
then a ≡1 n, then a ≡1
(mod p) (mod n)

Converse The converse is

The converse is (n)
true: If a ≡1
not always
(mod n), then a and
true.
n are coprime.

Requirement Requires the Does not require

modulus p to the modulus to be
be prime prime

Generalization More general,

Less general,
applicable to any
restricted to
positive integer
prime moduli
modulus

Applications of Euler's Theorem

Euler's Theorem has many applications in a wide range
of areas, such as mathematics and even elsewhere. Here
are some notable applications:

RSA Encryption: Euler's theorem is foundational in

modern cryptography, particularly in the RSA encryption
algorithm. RSA utilizes Euler's theorem in the process of
encryption and decryption. In RSA, the public and private
keys are generated in such a way that they are inverses
of each other modulo φ(n), where n is the product of two
large prime numbers.

Problem Solving in Number Theory: Euler's theorem is

a powerful tool in solving number theory problems
involving divisibility, remainders, and the properties of
numbers in different number systems.

Primality Testing: Euler's theorem is used in primality

testing algorithms, such as the Fermat primality test.
While this test is not infallible (it can give false positives
for Carmichael numbers), it offers a quick way to check
for non-prime numbers. If for some a coprime with φ(n) ≡
1 (mod n), then n is not prime.

Mathematical Proofs: Euler's theorem is a general case

for proofs enabling modular arithmetic, divisibility tests
and number theory identities and it provides clear and
convincing mathematical arguments that are the
foundation of rigorous mathematical analysis.

Read More,

Euler's Formula
Number Theory
Prime Numbers

Euler’s Theorem Examples

Example 1: Find the remainder when 3100 is divided by
7.

Solution:

Since 7 is a prime number, (7) = 7−1 = 6.

According to Euler's Theorem,
36 ≡ 1 (mod 7).
Now, 3100 can be rewritten as 36×16+4.
modular exponentiation:
3100 ≡ (36)16 × 34 ≡ 116 × 81 ≡ 4 (mod 7).
So, when 3100 is divided by 7, the remainder is 4.

Example 2: Find the remainder when 720 is divided by

21.

Solution:

Since 21 can be factored into 3 × 7, the GCD of 7

and 21 is 6, which is not 1, they are not coprime.
We have (21) = (3) (7)
(3) = 3 - 1 = 2
(7) = 7 - 1 = 6
(21) = (3) (7) = 2×6 = 12
According to Euler's Theorem,
712 ≡ 1 (mod 21).
Now, 720 can be expressed as 712×1+8.
modular exponentiation:
720 ≡ (712)1 × 78 ≡ 1 × 78 ≡ 1 (mod 21)
78 = (74)2 ≡ 72 ≡ 7 mod 21
Thus,
720 ≡ 7 mod 21
So, when 720 is divided by 21, the remainder is 6.

Practice Questions on Euler's Theorem

Q1. Find the remainder when 250 is divided by 11.

Q2. Calculate the remainder when 5100 is divided by

17.

Q3. Determine the remainder when 375 is divided by

13.

Q4. Find the remainder when 440 is divided by 9.

Q5. Find the remainder when 1025 is divided by 8.

FAQs on Euler's Theorem

What is Euler's Theorem?

Euler's Theorem verifies that if a and n are coprime

and positive integers, then a (n) ≡ 1 (mod n),
where (n) represents the result of Euler's totient
function, i.e. the number of positive integers less
than n that are coprime to n.

What is the significance of Euler's Theorem?

Euler's Theorem holds importance to number

theory and cryptology. That result forms the base
for all the other outcomes that provide an
understanding for the properties of modular
arithmetic and is necessary for various
cryptographic systems like RSA encryption system.

Can Euler's Theorem be applied to composite

moduli?

The fact that the Euler's Theorem can be applied to

composite moduli becomes clear, provided that for
the condition a and n are coprime positive integers
to be satisfied.

How can we use Euler's Theorem even today?

Euler's Theorem has been of relevance in number

theory and its extension in cryptography with the
main application to RSA encryption. Besides, it is
also a tool in the number theory, group theory

What are Euler's Theorem's general expressions?

Euler's Theorem, sometimes extended to

Carmichael's Theorem, Fermat's Little Theorem,
and multiple integers, forms the foundations of
number theory.

Comment More info

Next Article

Advertise with us
Green's Theorem

Similar Reads

Euler's Theorem
Euler's Theorem states that for any integer a that is coprime with a positive
integer m, the remainder of aÏ•(m) divided by m is 1. We focus on proving Euler'…
Theorem because Fermat's Theorem is essentially a specific instance of it. This
7 min read
relationship arises because when p is a prime number, Ï•(p) eq

Green's Theorem
Green's theorem applies in two dimensions (xy-plane) and relates a line integral
around a closed curve to a double integral over the enclosed area. It deals with…
the circulation or "swirliness" of a vector field. Green's theorem is a special case
of a 12 mingeneral
more read theorem called Stokes' theorem, whi

Liouville’s Theorem
Liouville's Theorem implies that every entire bounded function must be constant.
In other words, according to Liouville's theorem, "An entire (that is, holomorphic…
in the whole complex plane C) function cannot be bounded if it is not constant."
This7theorem
min readof complex analysis was given by a French

Lami's Theorem
Lami's Theorem, also known as Lami's Law, is a principle in statics and
mechanics of materials that relates the forces acting on a body in static…
equilibrium. It is named after the Italian mathematician and physicist Bernard
8 min
Lami. readTheorem is typically applied to a body or structure subjected
Lami's

DeMoivre's Theorem
De Moivre's theorem is one of the fundamental theorem of complex numbers
which is used to solve various problems of complex numbers. This theorem is…
also widely used for solving trigonometric functions of multiple angles.
6 min read Theorem is also called “De Moivre’s Identity†and
DeMoivre’s
“De Moivre’s Form
Brook’s Theorem
Brook’s Theorem is an important result in graph theory that deals with graph
coloring. Graph coloring involves assigning colors to the vertices of a graph so…
that no two adjacent vertices share the same color. Brook’s Theorem
15 min
provides a read
clear guideline on how many colors are needed for this task in

Norton's Theorem
Electrical engineering widely uses different theorems and laws to simplify the
circuits involved in this field. One such theorem is known as Norton's Theorem…
which is used for analysing linear circuits in electrical engineering. In this article,
8 min
we will read what is Norton's Theorem, what is the st
study

Remainder Theorem
The Remainder Theorem is a simple yet powerful tool in algebra that helps you
quickly find the remainder when dividing a polynomial by a linear polynomial,…
such as (x - a). Instead of performing long or synthetic division, you can use this
9 minto
theorem read
substitute the polynomial and get the remainder d

Circle Theorems
Circle is a collection of points that are at a fixed distance from a particular point.
The fixed point is called the centre of the circle and the fixed distance is called…
the radius of the circle. We come across many objects in real life which are round
5 min For
in shape. readexample, wheels of vehicles, ban

Stoke's Theorem
Stokes' Theorem is a fundamental result in vector calculus that relates a surface
integral over a closed surface to a line integral around its boundary. It is named…
after the Irish mathematician Sir George Stokes, who formulated it in the 19th
12 min
century. read Theorem states that the circulation (or
Stokes'

Company Languages DSA Data Science & Web Python Tutorial

About Us Python Data Structures ML Technologies Python
Corporate & Legal Java Algorithms Programming
Communications Address: Data Science With HTML
Privacy Policy C++ DSA for Beginners Python CSS Examples
A-143, 7th Floor, Sovereign
Corporate Tower, Sector- In Media PHP Basic DSA Data Science For JavaScript Python Projects
136, Noida, Uttar Pradesh Contact Us GoLang Problems Beginner TypeScript Python Tkinter
(201305) Advertise with us SQL DSA Roadmap Machine Learning ReactJS Web Scraping
GFG Corporate R Language Top 100 DSA ML Maths NextJS OpenCV Tutorial
Registered Address: Solution Android Tutorial Interview Problems Data Visualisation Bootstrap Python Interview
K 061, Tower K, Gulshan Placement Training Tutorials Archive DSA Roadmap by Question
Vivante Apartment, Sector Pandas Web Design
137, Noida, Gautam Buddh Program Sandeep Jain NumPy Django
Nagar, Uttar Pradesh, GeeksforGeeks All Cheat Sheets
201305 NLP
Community Deep Learning

Computer DevOps System Design Inteview School GeeksforGeeks

Science Git High Level Design Preparation Subjects Videos
Operating Systems Linux Low Level Design Competitive Mathematics DSA
Computer Network AWS UML Diagrams Programming Physics Python
Database Docker Interview Guide Top DS or Algo for Chemistry Java
Management Kubernetes Design Patterns CP Biology C++
Advertise with us Azure OOAD
System Company-Wise Social Science Web Development
So!ware GCP System Design Recruitment English Grammar Data Science
Engineering DevOps Roadmap Bootcamp Process Commerce CS Subjects
Digital Logic Design Interview Company-Wise World GK
Engineering Maths Questions Preparation
So!ware Aptitude
Development Preparation
So!ware Testing Puzzles

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and
Got It !
@GeeksforGeeks, Sanchhaya Education Private understood
Limited,our Cookiereserved
All rights Policy & Privacy Policy
HIDE AD