
The division of Berlin during the Cold War had left no remainders.
In my previous post, we discussed the cyclical nature of the remainders when an is divided by d. In this post, we will see how problems on finding out the remainder can be broken down into smaller parts.
Funda 1: Remainder of a sum when it is being divided is going to be the same as the sum of the individual remainders.
? Rem = Rem + Rem + Rem ...
Let us look at an example for this case.
Find out the remainder when (79+80+81) is divided by 7.
If we add them up, we get the sum as 240 and the remainder is 2. However, it would be easier to find out the individual remainders of 79, 80 & 81; which come out to be 2, 3 & 4 respectively and adding them up later to get the answer. This process is shown below,
Rem (79+80+81) = Rem (2+3+4)/7 = Rem (9/7) = 2
I hope you would agree that the second method is easier. But the difference in difficulty level is not that well highlighted here. Let us look at another idea on the same lines.
Funda 2: Remainder of a product when it is being divided is going to be the same as the product of the individual remainders.
? Rem = Rem * Rem * Rem ...
Let us look at an example for this case,
Find out the remainder when (79 x 80 x 81) is divided by 7.
If we multiply it first, we get the product as 511,920 and the remainder as 3. However, it would be easier to find out the individual remainders of 79, 80 & 81; which come out to be 2, 3 & 4 respectively and then multiply them to get 24, which will eventually lead to the remainder of 3.
Rem (79 * 80 * 81) = Rem (2 * 3 * 4)/7 = Rem (24/7) = 3
I guess there is no doubt now that the second method is easier. To be honest, I would take more time to just find out the product of (79 x 80 x 81) than to solve the entire question. That is the reason I recommend breaking down the problem into smaller parts.
Funda 3: Negative Remainders When the absolute value of the negative remainder is less than the absolute value of the positive remainder, it is recommended that you consider a multiple greater than the divisor.
When 7 is divided by 4, the remainder can be considered as 3 or -1.
When 18 is divided by 7, the remainder can be considered as 4 or -3.
When 689 is divided b 23, the remainder can be considered as 22 or -1.
As you can see from above, the calculations would reduce drastically in the third case if you considered a negative remainder. As a tip, in remainder questions, you should always think of multiples or powers which can lead to a remainder of 1 or -1. Till now, the examples I have taken are too simple to be asked in the Common Admission Test (CAT) or for that matter any other MBA entrance exam. Let us look at an example that uses all the above-mentioned ideas and is of a slightly higher difficulty level.
Find out the remainder when 83261 is divided by 17.
First of all we need to break down 83261into smaller parts.
Rem (83261/17) = Rem
We know that Rem (83/17) = 15 or -2.
It would be easier if consider the remainder as -2 because our calculations would be easier. So our question reduces to,
Rem = Rem = -Rem
Now, referring to the tip I gave above, think of a power of 2 that would give a remainder of 1 or -1 from 17. 24 is 16 and would give a remainder of -1 from 17. We have a 2261 here. We will have to break it down to (2260 x 2) so that we can convert it to a power of 16. This step is shown below,
-Rem = -Rem = -Rem
-Rem = -Rem = 2
I highly recommend that in this question and other questions of this type, you should verify the answer from Wolfram Alpha. Hope you found this article useful. I look forward to your suggestions for future posts.
Author Ravi Handa has taught Quantitative Aptitude at IMS for 4 years. An alumnus of IIT Kharagpur where he studied a dual-degree in computer science, he has also written a book on business awareness.
negative remianders are much easier to work with for example
if i say find remainder when (24222421)^n / 2422
you can write as (2422k -1)^n /2422
now if you open the binomial expansion very term will be divisble by 2422 exxcept nCn (-1)^n ... Now if n is even remainder will be simple 1
if n is odd , remainder is -1, which means it is actually divisor -1
he is breaking number into smaller parts
like 95/13 yields same remainder as 30/13 . I subtracted a multiple of 13 from numerator i.e 65
in this case thenumber is too big... so he is making it short by removing 680000 from numerator as the remaining numerator will yield same numerator
when 50! is divided by 16^15 what will be the reminder ?
give options.....I could solve till step below
16^15= 2^60
number of 2's in 50!=47
so remainder will be definitely a multiple of 2^47 ????
1
0
2
4
actually there will be 48 2's in 50! .'. 2^48 will be completely divided and we will left with only odd no. and on denominator there will be 2^12 only now what to do ??
-> to find the last digit of of 7 to the power 325
-> to count the number of zeros in 4 to the power 2000
-> to find the last non zero digit of 4 to the power 2000