NUMBER SYSTEM (Remainder)
NUMBER SYSTEM (Remainder)
NUMBER SYSTEM (Remainder)
Divisibility Test
Factors
Factorial
Remainder
Unit place digit
Last Two digit
L.C.M. and H.C.F.
Any number in the world can be written
as:
N = (Re) Mod (Divisor)
80 = 8 Mod (9)
24 = 4 Mod (5)
26 = 5 Mod (7)
If X = Y Mod C
Then X-Y = 0 Mod C
80 = -1 Mod (9)
24 = -1 Mod (5)
26 = -2 Mod (7)
A = B Mod C
D = E Mod C
F = G Mod C
A X D X F = B X E X G Mod C
BXEXG<C
Note:- This rule is applicable only
on 3 operations (addition,
subtraction and multiplication).
(1421 X 1423 X1425 ) ÷ 12
what is the remainder?
1421 = 5 Mod 12
1423 = 7 Mod 12
1425 = 9 Mod 12
Using rule – 1 :-
1421 X 1423 X 1425 = 5 X 7 X 9 Mod 12
= 315 Mod 12
315/12 = Re = 3
(63 x 97 x 88 x 189 x 148) / 17
If A = B Mod C
Then A = B Mod C
n n
B <C
n
Q. 2 ÷ 15
600
So, we can replace them with numbers that are congruent modulo 19.
23 23 23 23
= (−4) + (4) (mod 19)=(−4) +(4) (mod 19)
23 23 23 23
= −(4 )+4 (mod 19)=−(4 )+4 (mod 19)
= 423−(423)(mod 19)=423−(423)(mod 19)
= 0(mod 19)=0(mod 19)
Therefore, the remainder is exactly zero.
Q. If a number is divided by 102, the
remainder obtained is 91. If the
same number is divided by 17, then
remainder will be?