Technique
Every remainder short of its divisor by the same amount: add that amount
Quantitative Aptitude • Number System
Statement
If , then : a remainder 2 short of the divisor means divides exactly. So when every divisor leaves the remainder , the number is a multiple of every divisor, and so of their LCM: for some whole number .
How to use it
- 1For each divisor, work out divisor minus remainder. If all of these are equal, call the common value g.
- 2Then N + g is a multiple of the LCM of the divisors.
- 3List for
and pick the one the question asks for: the smallest, the smallest 4-digit one, and so on.
Worked example
Find the smallest number that leaves remainder 3 when divided by 4 and remainder 5 when divided by 6.
Step-by-step
- 1and : both remainders are 1 short.
Why: One more would make each division exact.
- 2So is a multiple of .
- 3Smallest: . Check: .
Answer
11
Watch out
Subtracting the remainders (using N minus r) works only when all the remainders are equal. Here it is the shortfall that is shared, so it is added.
Builds on
Also known as
constant difference remainder, divisor minus remainder, remainder short by the same amount