Number System-Euler And Chinese

Remainder Theorem

( By Sameer Sardana)
• Teaching Live On Unacademy Plus
• Subscribe to Unacademy Plus Using
Code sameersardana.ubs-5752 For
10% Off on Unacademy Plus
Subscription
• 1000+ Free Video Lesson On
Unacademy Learning App

Referral Code- sameersardana.ubs-5752

The Euler Number of a Natural Number X means
the numbers of natural number which are less than
X and are Co-prime to X

Two numbers are said to be co-prime when there

HCF is 1.

Referral Code-
sameersardana.ubs-5752
Euler no of 12
Number less than or equal to
12=1,2,3,4,5,6,7,8,9,10,11,12
2,4,6 and 8,10 and 12 are not co-prime with 12
Similarly 3 and 9 are also not co-prime with
So Euler no of 12 is 4

Referral Code-
sameersardana.ubs-5752
• Alternate method-
• Factorization ,12=2*2*3
• 2 and 3 are the prime factor of 12, it means every second no
out of these 12 no will have a common factor of 2 with 12.
which means ½ of total 12 nos will not form a co-prime pair
with 12.
• Similarly, out of 6 remaining nos every 3 no will have a
common factor of 3 with 12.so we will be left with 2/3rd of
remaining 6 nos i.e 4 nos will be co-prime to 12
E(N) = N[(1-1/a)(1-1/b)(1-1/c)]

Here a,b and c are different prime factors of N.

For a prime number P, as P is the only prime

factor of that no so, E(P) = P(1-1/P) = P-1 always

Referral Code-
sameersardana.ubs-5752
Euler Theorem- It states that when aN is divided by
b, where n is Euler no of b and a & b are co- prime to
each other , remainder will always be 1 .

Eg. Find the remainder when 2710 is

divided by 11

Referral Code-
sameersardana.ubs-5752
Q1. Find the remainder when 3760
is divided by 13

Referral Code-
sameersardana.ubs-5752
Q2. Find the remainder when 5797
is divided by 17

Referral Code-
sameersardana.ubs-5752
Q.3: Find the remainder when
57112 is divided by 23

Referral Code-
sameersardana.ubs-5752
Q.4: Find the remainder when
60122 is divided by 11

Referral Code-
sameersardana.ubs-5752
QUE.5: (2223333 + 3332222 + 4445555 ) ÷ 11

Referral Code-
sameersardana.ubs-5752
QUE.5: (2223333 + 3332222 + 4445555 ) ÷ 11

2223333 ÷ 11= 23333 ÷ 11

Use Euler Remainder Theorem Now-
222 & 11 are co-prime to each other & Euler no
of 11 is 10.
Remove the multiple of 10 from 3333,
Remainder =3.
So, 23330 ÷ 11 , will give you a remainder of 1.
23 ÷ 11 , Remainder will be 8.
Referral Code-
sameersardana.ubs-5752
QUE.5: (2223333 + 3332222 + 4445555 ) ÷ 11

3332222 ÷ 11
Use Euler Remainder Theorem -
333 & 11 are co-prime to each other & Euler no
of 11 is 10.
Remove the multiple of 10 from 2222,
Remainder =2.
So, 33332220 ÷ 11 , will give you a remainder of 1.
32 ÷ 11 , Remainder will be 9.
Referral Code-
sameersardana.ubs-5752
QUE.5: (2223333 + 3332222 + 4445555 ) ÷ 11

4445555 ÷ 11
Use Euler Remainder Theorem -
444 & 11 are co-prime to each other & Euler no
of 11 is 10.
Remove the multiple of 10 from 5555,
Remainder =5.
So, 4445550 ÷ 11 , will give you a remainder of 1.
45 ÷ 11 , Remainder will be 1.
Referral Code-
sameersardana.ubs-5752
QUE.5: (2223333 + 3332222 + 4445555 ) ÷ 11

= 8 + 9 + 1
= 7. Ans

Referral Code-
sameersardana.ubs-5752
QUE.6: Find the remainder

 23
50
44
38

Referral Code-
sameersardana.ubs-5752
QUE.7: Find the remainder

 17
59
65
57

Referral Code-
sameersardana.ubs-5752
 37
QUE.8: 3963 ÷11
(A) 1 (B) 2 (C) 3 (D) 4

Referral Code-
sameersardana.ubs-5752
 37
QUE.8: 3963 ÷11
(A) 1 (B) 4 (C) 6 (D) 7

Use Euler Remainder Theorem -

a.39 & 11 are co-prime to each other & Euler no
of 11 is 10.

Now the next step is to remove multiple of 10

from 6337 , i.e. find the remainder when 6337 is
divided by 10

Referral Code-
sameersardana.ubs-5752
 37
QUE.8: 3963 ÷11
(A) 1 (B) 4 (C) 6 (D) 7

Use Euler Remainder Theorem again to find the

remainder when 6337 is divided by 10 -

a.63 & 10 are co-prime to each other & Euler no

of 10 is 4.
Now the next step is to remove multiple of 4
from 37 , i.e. find the remainder when 37 is
divided by 4,
37/4, remainder=1
Referral Code-
sameersardana.ubs-5752
 37
QUE.8: 3963 ÷11
(A) 1 (B) 4 (C) 6 (D) 7

6337 6336 * 631

So, 4 = 4
= 1* 3 = 3

63 37
39 3910 multiple * 393 63
= = =7
11 11 11

Referral Code-
sameersardana.ubs-5752
QUE.9: Find the last two digit of 372842

Referral Code-
sameersardana.ubs-5752
 812004
QUE.10: Find the last two digit of 47

Referral Code-
sameersardana.ubs-5752
QUE.11: Find the Remainder

 17
63
51
39

Referral Code-
sameersardana.ubs-5752
QUE.12: Find remainder when 3567812 is
divided by 24.

Referral Code-
sameersardana.ubs-5752
Find remainder when 3567812 is divided by 24.

Factorize 24 into co-prime numbers- 3*8

Remainder if the given number is divided by 3= 2

Remainder if the given number is divided by 8=4

Find the least such number which when divided

by 3 should give a remainder of 2 and when
divided by 8 should give a remainder of 4
Referral Code-
sameersardana.ubs-5752
First number giving a remainder of 4 when divided by 8=4

But 4 does not give a remainder of 2 when divided by 3. so, 4

will not be the answer.

Second number giving a remainder of 4 when divided by 8=12

Third number giving a remainder of 4 when divided by 8=20

20 , also gives a remainder of 2 when divided by 3.

S0 Answer is 20.

Referral Code-
sameersardana.ubs-5752
Qus-13
Find remainder when 56789242 is divided by
72

Referral Code-
sameersardana.ubs-5752
Find remainder when 56789242 is divided by 72

Factorize 72 into co-prime numbers- 8*9

Remainder if the given number is divided by 8= 2

Remainder if the given number is divided by 9

Using divisibility rule of 9= 43/9= 7

Now, Find the least such number which when

divided by 8 should give a remainder of 2 and
when divided by 9 should give a remainder of 7
First number giving a remainder of 7 when divided by 9=7

But 7 does not give a remainder of 2 when divided by 8. so, 7

will not be the answer.

Second number giving a remainder of 7 when divided by 9=16

Third number giving a remainder of 7 when divided by 9=25

Fourth number giving a remainder of 7 when divided by 9=34

32 , also gives a remainder of 2 when divided by 8.

So, Answer is 32. Referral Code-

sameersardana.ubs-5752
Qus-14
Find remainder when 3456289546758246 is
divided by 144

1.105 2.102 3.70 4.86

Referral Code-
sameersardana.ubs-5752
Qus-14
Find remainder when 3456289546758246 is
divided by 144

1.105 2.102 3.70 4.86

144= 16*9
Remainder from 16 =8246/16=6
Remainder From 9= 3
Referral Code-
sameersardana.ubs-5752
 Qus-15:
Find remainder when 1234567891011………5657
is divided by 40

Referral Code-
sameersardana.ubs-5752
 Qus-15:
Find remainder when 1234567891011………5657
is divided by 40

40= 5*8
Remainder from 5 =7/5=2
Remainder From 8= 657/8=1
First number giving remainder of 1 when divided
by 8= 1
Second Number= 1+8=9
Third number= 9+8=17
Answer is 17 as it is will give both required
remainder.
Qus-16:
Find remainder when 17258 is divided by 480

1.264 2.374 3.289 4.479 5.181

Referral Code-
sameersardana.ubs-5752
Qus-16
Find remainder when 17258 is divided by 480

1.264 2.374 3.289 4.479 5.181

480= 3*5*32
Remainder from 3 = 17258 /3= (-1)258 =1
Remainder From 5= 17258 /5= 2258 /5 = (1664 *
4)/5= 4
Referral Code-
sameersardana.ubs-5752