Scribd
Upload
60 views

Euler's Theorem

Euler's theorem and Euler's totient are important concepts for understanding remainders. [1] Euler's totient is defined as the number of numbers less than n that are relatively prime to it. [2] Euler's theorem states that if a and n are relatively prime, then a^φ(n) is congruent to 1 modulo n. [3] This theorem can be used to find remainders by expressing the exponent as a multiple of φ(n).

Uploaded by

Samaresh Mallick
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
60 views

Euler's Theorem

Euler's theorem and Euler's totient are important concepts for understanding remainders. [1] Euler's totient is defined as the number of numbers less than n that are relatively prime to it. [2] Euler's theorem states that if a and n are relatively prime, then a^φ(n) is congruent to 1 modulo n. [3] This theorem can be used to find remainders by expressing the exponent as a multiple of φ(n).

Uploaded by

Samaresh Mallick
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Euler’s Theorem

for CAT

`
Solved CAT Previous Papers

Download Verbal Ability for CAT PDF

Euler’s totient

Euler’s theorem is one of the most important remainder theorems. It is


imperative to know about Euler’s totient before we can use the theorem.

Euler’s totient is defined as the number of numbers less than ‘n’ that are
co-prime to it.
It is usually denoted as ɸ(n).
1 1
The formula to find Euler’s totient is ɸ(n) = n*(1 - ) * (1 - )*… where a, b
𝑎 𝑏
are the prime factors of the numbers.

Eg) Find the number of numbers that are less than 30 and are co-prime to
it.

30 can be written as 2*3*5.


ɸ(30) = 30 * 1/2 * 2/3 * 4/5
=8

Therefore, 8 numbers less than 30 are co-prime to it.

Solved CAT Previous Papers


Take free CAT Mock

Enroll To CAT Courses: https://cracku.in/cat/pricing

Top rated app for CAT

Take free CAT Mock


Solved CAT Previous Papers

Euler’s Theorem

Euler’s theorem states that 𝑎ɸ(n) (mod n ) = 1 (mod n) if ‘a’ and ‘n’ are co-
prime to each other.
So, if the given number ‘a’ and the divisor ‘n’ are co-prime to each other, we
can use Euler’s theorem.

Example 1:
What is the remainder when 2256 is divided by 15?
2 and 15 are co-prime to each other. Hence, Euler’s theorem can be applied.
15 can be written as 5*3.
1 1 2 4
Euler’s totient of 15 = 15*(1 - )* (1 - ) = 15* * = 8
3 5 3 5

Therefore, we have to try to express 256 as 8k + something. 256 can be


expressed as 8*32

We know that, 𝑎ɸ(n) (mod n ) = 1 (mod n)


28∗32 (mod 15 ) = 1 (mod 15).

Therefore, 1 is the right answer.

Quant Formulas for CAT [Download PDF]

Solved CAT Previous Papers


Take free CAT Mock

Example 2:
What are the last 2 digits of 72008 ?

Finding the last 2 digits is similar to finding the remainder when the
number is divided by 100.
100 and 7 are co-prime to each other. Hence, we can use Euler’s theorem.

100 can be written as 22 ∗ 52 .


1 1
Euler’s totient of 100, ɸ(100) = 100*(1 - ) * (1 - ).
2 5

1 4
= 100* ( ) * ( )
2 5
ɸ(100) = 40.

72008 can be written as 72000 *78

72000 can be written as 740∗(25) . Hence, 72000 will yield a remainder of 1


when divided by 100.
The problem is reduced to what will be the remainder when 78 is divided
by 100.
We know that 74 = 2401.
78 = 74 *74 = 2401*2401.

As we can clearly see, the last 2 digits will be 01.

Personal guidance for CAT by IIM alumni


https://www.facebook.com/groups/catsuccess/

Take free CAT Mock


Solved CAT Previous Papers

Download Important Questions & Answers PDF Below:


Verbal Ability & Reading comprehension
Data Interpretation
Logical Reasoning
Quantitative Aptitude

Get Important MBA Updates


Whatsapp
Telegram
Join FB CAT Group

Whatsapp ‘CAT’ to join in CAT Group to this number (7661025559)

Download Android App here for CAT.

Download IOS App here for CAT.

Solved CAT Previous Papers

You might also like