Finding Remainders

Theorems for finding remainders

Fermat's remainder theorem: Let P be a prime number and N be a number not divisible by P.
Then the remainder obtained when Np-1 is divided by P is 1.
Therefore the remainder when N(p-1)k is divided by P is also 1. Therefore 126 or 3512 or 358760
when divided by 7 will give a remainder of 1, since the power in each case is a multiple of 6.

Example: What is the remainder when 2100 is divided by 101?

Since it satisfies the Fermat's theorem format, remainder = 1

Example: What is the remainder when 45123 is divided by 7?

Since 7 is a prime number therefore 456 when divided by 7 will give a remainder of 1
Therefore 456x20 (45120) when divided by 7 will also give a remainder of 1
45123 = 45120 x 453
Remainder 453 is divided by 7 is 33 i.e. 27
27 when divided by 7, the remainder is 6
Therefore remainder when 45123 is divided by 7 is 1 x 6 = 6

Fermat's Little theorem: If p is prime and a is any integer, then ap - a is divisible by p. This also
means that when ap is divided by p the remainder is same as when a is divided by p.
For example what is the remainder when 6826 is divided by 13.
Remainder when 6813 is divided by 13 is same as when 68 is divided by 13 i.e. 3
Therefore remainder of 6813 x 6813 is same as 3 x 3 i.e. 9, when divided by 13
So the remainder is 9

Euler's theorem of remainder: Let f(n) be the number of integers less than n and co-prime with
n, then the remainder obtained when mf(n) is divided by n is 1 , where m and n are co-prime to
each other.
As we can see:
f(2) = 1, f(3) = 2, f(4) = 2, f(5) = 4
So, the remainder obtained when 8f(5)=4 is divided by 5 is 1 . It can also be seen that the
remainder obtained when any power of 8 divisible by 4 such as 8 4 or 88 or 812 and so on will
give the same remainder when divided by 5.

Wilson's theorem: An integer p> 1 is prime if and only if the factorial (p - 1) ! + 1 is divisible by
p. Conversely, an integer n > 4 is composite if and only if (n— 1)! is divisible by n.
This means that remainder when (p-1)! Is divided by p is (-1) i.e. (p-1)
For example remainder when 12! Is divided by 13 is 12

From here we can conclude that remainder when (p-2)! Is divided by p is 1

For example remainder when 39! is divided by 41 is 1

Finding Remainders ABS Classes 1

Finding Remainders

Derivations of Remainder rules

1) is divisible by , only when is odd.
2) is never divisible by
3) is always divisible by
4) is divisible by only when is even.
5) ) is divisible by (a + b + c), if n is odd and a, b, c, are in arithmetic
progression

Examples
1) CAT 2004: Remainder when 1523 + 2323 divided by 19.
15 + 2323 will be divisible by (15+23) i.e. 38 so it will be divisible by 19 also
23

Alternatively, remainder is (-4)23 + 423 i.e. 0.

2) Which of the following option gives the factors of (312 – 1)

a) 728 & 80
b) 6643 & 28
c) 27 and 730
d) All of the above
e) None of the above

312 – 1 = -1 = ( +1)( -1). Thus 312 – 1 is divisible by 728 and 730

312 – 1 = -1. Thus 312 – 1 is divisible by 28 and 27
12
3 –1= -1 = ( -1)( + +1). Thus 312 – 1 is divisible by 80 and 6643
Hence option (d)

3) What is the remainder when (163 + 173 + 183 + 193) is divided by 70? (CAT 2005,1 mark)
) is divisible by (a + b + c), if n is odd and a, b, c, are in arithmetic progression.
Now 16 + 17+ 18 + 19 = 70, so remainder is zero. (As a, b, c, d are in AP)

Finding Remainders ABS Classes 2