Scribd
Upload
10 views

Number System(Divisibility, Unit – Digit, Remainders)

The document covers various mathematical concepts related to divisibility, unit digits, and remainders. It includes problems and examples for finding divisibility by specific numbers, calculating unit digits in products and sums, and determining remainders for different divisions. Additionally, it introduces Euler's theorem and its application in finding remainders when numbers are co-prime.

Uploaded by

2305a41023
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
10 views

Number System(Divisibility, Unit – Digit, Remainders)

The document covers various mathematical concepts related to divisibility, unit digits, and remainders. It includes problems and examples for finding divisibility by specific numbers, calculating unit digits in products and sums, and determining remainders for different divisions. Additionally, it introduces Euler's theorem and its application in finding remainders when numbers are co-prime.

Uploaded by

2305a41023
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Number – System

(Divisibility, Unit – Digit, Remainders)


Divisibility Rules
Replace * by smallest number to make 53*46
divisible by 3 .
a.0 b. 3 c. 6 d. 9

Replace * by smallest number to make 3475*


divisible by 4.
a. 2 b. 6 c. 8 d.9

Which one of the following numbers is divisible by 99


a. 3572404 b.135792 c.913464 d.114345
Which one of the following numbers is divisible by 7 & 11
a.16324 b.12235 c.16257 d.16425

Find the greatest number 23a68b which is divisible by 3


but not divisible by 9
a.238689 b. 239685 c.239688 d.237687
If the 9 digit number 89x64287y is divisible by 72,
then what is the value of (3x+2y) ?

a. 25 b. 30 c. 31 d. 28
What least number must be subtracted from 2014 to
obtain a number which is exactly divisible by 17 ?

a. 8 b.9 c.10 d.15

What least number must be added to 2014 to obtain a


number which is exactly divisible by 17 ?

a.9 b.10 c.15 d.20


In a division sum, the divisor is 6 times the quotient 3 times the
remainder. If the remainder is 40 find the number ?

a.1400 b. 1440 c. 2440 d. none


Finding Unit Digit
Find the unit digit in the
product of the expression

-853 × 1346 × 85

-1219 × 327 × 238 × 86

- 1256 + 358 + 254 – 357

- 356 + 458 - 148


Remainders
Find the remainder when 72 is divided by 10?

Find the remainder when 4 × 8 is divided by 3?

Find the remainder when 32 × 23 is divided by 5?

Find the remainder when 17×18 ×22 ×23 divided by 15?


Concept of Negative Remainders

Find the Remainder for following

8 ÷ 10 = ? 140 ÷ 11 = ? 19 ÷ 5 = ?

58 ÷ 7 = ? 64 ÷ 5 = ? 23 ÷ 6 = ?

(14 × 15 × 16 × 17 × 18) ÷ 19 = ?
Find the remainder when
i. is divided by 39
ii. is divided by 39
iii. is divided by 4
iv. is divided by 4
v. is divided by 33
vi. is divided by 33
Find the remainder when
i. is divided by 8
ii. is divided by 11
iii. is divided by 13
iv. is divided by 28
v. is divided by 7
vi. is divided by 17
vii. is divided by 17
Concept of Cancellation Factor in Remainders

Find the Remainder for following

20 ÷ 15 = ? 100 ÷ 40 = ? 99 ÷ 77 = ?

is divided by 28 = ?

is divided by 30 = ?
Concept of Euler’s Theorem in Remainders

Euler Number – Numbers before a number N that are co


prime to N.

- Find the no’s from 1 to 30 that are not multiples of 3?


- Find the no’s from 1 to 50 that are not multiples of 5?
- Find the no’s from 1 to 30 that are neither multiples of
2 nor multiples of 5?
-
- Find the Euler no. of 60?
- Find the Euler no. of 10?
- Find the Euler no. of 420?
a b c
Note – If N = P1 × P2 × P3 ………..

EN = N (1 – 1/P1) (1 – 1/P2) (1 – 1/P3)…….


where P1, P2, P3 are prime factors of N (N should be non – prime number)

Euler no. of prime number EP = P – 1


Application of Euler’s Theorem in Remainders

a
To apply Euler’s theorem it should be in the form of (X ÷ b) and
X and b should be co-prime with each other.

Example:
is divided by 7 find remainder?
Here (11,7) are co-primes, so we can apply Euler’s concept
Find the remainder when
i. is divided by 29
ii. is divided by 10
iii. is divided by 25
iv. is divided by 25
v. is divided by 17
Thank you

You might also like