Professional Documents
Culture Documents
Remainder: + Ve and - Ve Remainder
Remainder: + Ve and - Ve Remainder
Remainder
Before talking about the big fundas of remainder, let me come to basic things……….
+ ve and – ve remainder
If I ask you what is the remainder when 37 is divided by 7; obviously you will say 2.
Because
7 37 5
-35
2
What if we do it in these ways:-
7 37 6 7 37 4 7 37 3
-42 28 21
-5=2-7 9=2+7 16=2+7+7
So, we can get 2, -5(=2-7), 9(=2+7), 16(=2+7+7) as remainder, when 37 is divided
by 7. Our standard remainder is 2. So, whenever we want –ve remainder, we will subtract 7
from std. remainder and whenever we will get –ve remainder, we will add 7 to make it
positive.
Soln: 17 A M 17 B N
4 15
So, A=17M+4
B=17N+15 (B’Coz Dividend = Divisor*Quotient + Remainder)
We will divide individual term by x to get the remainder and will apply the
corresponding arithmetic operation (i.e. addition, subtraction , multiply etc.)
Tip: if remainder of ‘am’ by n is asked, divide a by ‘n’ and get the remainder ‘r’ then
question will become
Am/n = rm /n (this is to reduce the sum)
When x+7 is divided by 15, remainder is 4. What is remainder when 2x+3 is
divided by 5.
15 x+7 5 2x+3
4 ?
CYCLICITY IN REMAINDER:
Remainder when 397 is divided by 32.
We will check remainder for 31, 32, 33, 34,….
i.e. write down remainder when 31, 32, 33, 34,….are divided by 32.
Remainder By 32
1
3 (=3) 3
32(=9) 9
33(=27) 27
34(=81) 17
36(=19*3) 25
37(=25*3) 11
38(=11*3) 1
39(=1*3) 3
310(=39*3=3*3=9) 9
311 27
……..
and so on.
Tip: For finding remainder, find the cyclicity. Divide the power by cyclicity. As in above sum,
we will divide 97 by 8=remainder of 1
So,397=31
Ist way:
Find any power of 4 which is near to multiple of 9 and bingo this is 4 3=64(near to 63)
So, 448 = (64)16
= (63+1)16
= 116
= 1 Ans.
2nd way:
Go by cyclicity:-
Remainder by 9
1
4 4
42(=16) 7 (cycle of 3)
43(=64) 1
44(=43*4=1*4) 4
I got the cyclicity of 3. So, divide the power (=48) by 3 since remainder is 0
=it will be the last step of cyclicity
=448 will leave remainder 1.
3rd way:
448=296
= (23)32
= (8)32= (-1)32= 1 Ans.
Is there any other way to reduce owe effort to find remainder. Let us take a smaller
example:
Remainder when 10 is divided by 4?
10
Obviously 4 =2 (remainder)
5
What if we cancel out 2 from 10 and 4? It will become 2 =1 (remainder)
But remainder in both cases is not same. So, to make a question easy, cancel out a
common factor from both dividend and divisor. Find remainder by any way. Multiply this
remainder by the no. which we have cancelled out.
e.g. in above sum, we have cancelled 2.later we got remainder 1. We will multiply it by 2.
So, our ans. Will be=2*1=2 Ans.
I guess following sum will explain it beautifully.
22 4
23 8
24 16
25(=32) 7
26(=7*2) 14
27 3
28 6
211 -2
212 -4
213 -8
214 -16
215 -7
216 -14
217 -3
218 -6
219 -12
220 1
So, we have got cycle of 20.divide power (=106) by 20 remainder is 6 and ans. For 2 6
is 14.
But final ans. = 14*4=56
In above sum, cyclicity is of 20. Isn’t there any smaller method to calculate remainder?
An arts student asked me this question. Being P.G. in mathematics, I felt that in
discussion of remainder, Euler no. can be neglected. I am not discussing the origin of
Euler No. (& if you want to enjoy complete recipe of Euler no., go to Olympiad Tab) we
will do learn only calculate Euler number and to apply it.
Euler Number:
I will go step by step. Read each line thoroughly. Don’t miss any sum.
4¿
100¿ ¿
How many numbers are divisible by 4, one will simply say, ¿ = 25
4¿
1¿ ¿
i.e. ¿ th of the numbers are ÷ by 4,
4¿
1¿ ¿
i.e. 1- ¿ th of the numbers are not ÷ by 4
4¿
3¿ ¿
i.e. ¿
of the numbers are not ÷ by 4
i.e. 75numbers are not ÷ by 4
How many natural numbers ≤ 100, are Co-prime (H.C.F. =1) to 100?
100=22*52
I.e. we are looking for those numbers ≤ 100 which do not have 2 and 5. Because then
only they will be co-prime to 100.
I.e. we will take those numbers which are neither multiple of 2 nor of 5. So, question
becomes “How many natural numbers ≤ 100 are not divisible by 2 and 5?
1
Now 2 of total numbers are ÷ by 2
1 1
So, 1- 2 = 2 of total numbers are not ÷ by 2
So, 50 numbers are not divisible by 2.
Out of these 50 numbers, every 5th number is a multiple of 5.
1
I.e. 5 of 50 numbers are ÷ by 5
1 4
I.e. 1- 5 = 5 of these 50 numbers are not ÷ by 5
4
So, 5 *50=40 of total numbers are not ÷ by 2 or 5
I.e. Co-prime to 100.
n aΦ(n)
1
Here n and a are co-prime to each other.
2100/100
Here 2 and 100 are not co-prime.
To make it co-prime, we will cancel 22=4 from numerator and denominator (obviously
later we will multiply, I hope u remember). So, I am left with
298/25
I hope now you will be able to crack these types of questions easily. We have many more
things to do in remainders as multiplicative inverse, Carmichael nos. etc. We’ll discuss those
in another article. Till then practice remainders. Best of luck…Yeah, 1 thing more…dnt forget
to rate the article…