Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case
Quantitative Aptitude › HCF, LCM and Divisibility Rules · Topic 2.8
The greatest number that divides given numbers and leaves the same remainder in each case is the HCF of the differences between the numbers. The remainder itself is then found by dividing any one of the given numbers by that greatest divisor.
5 min read · Quantitative Aptitude · HCF, LCM and Divisibility Rules
Quick Answer
The greatest number that divides given numbers and leaves the same remainder in each case is the HCF of the differences between the numbers. The remainder itself is then found by dividing any one of the given numbers by that greatest divisor.
At a Glance
- Rule Greatest divisor = HCF of the differences
- Why Equal remainders cancel in a difference
- Remainder Any given number divided by the divisor
- Two numbers One difference
- Three numbers HCF of two differences
- Divisor must be larger than the remainder
Where Does It Fit?
This topic uses the HCF of Highest Common Factor (HCF) by Division and Prime Factorization Method. It reverses the least-number problems of Least Number Divisible by Given Numbers Leaving a Specified Common Remainder, where the LCM was used. The next topic, Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders, handles the case where the remainders are given and may differ.
Why Is the Answer the HCF of the Differences?
In short: if two numbers leave the same remainder with a divisor d, their difference is a multiple of d, because the equal remainders cancel.
- Write it out: a = d×p + r and b = d×q + r, so a − b = d × (p − q).
- Consequence: d divides every difference between the numbers.
- Greatest d: the greatest such d is the HCF of the differences.
- Remainder: divide any one of the numbers by d.
Rule
- For numbers a, b, c leaving the same remainder, d = HCF(b − a, c − b).
- Remainder = a mod d.
- For two numbers, d is their difference or a factor of it.
How Do You Apply the Method to Two or Three Numbers?
In short: subtract to get the differences, find the HCF of those differences, and then find the remainder.
| Numbers | Differences | HCF of differences | Remainder |
|---|---|---|---|
| 74, 116, 158 | 42, 42 | 42 | 32 |
| 28, 43, 73 | 15, 30 | 15 | 13 |
| 55, 91 | 36 | 36 | 19 |
The HCF itself is found by the methods in Highest Common Factor (HCF) by Division and Prime Factorization Method.
What Checks Should You Make?
- Remainder smaller than divisor: the remainder must be less than the divisor, otherwise a smaller quotient is possible.
- Verification: divide each original number by d and confirm the remainder is the same.
- Differences: use differences of consecutive numbers; using all pairs gives the same HCF.
- Next step: when the remainders are known and different, use Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders.
Solved Examples
Example 1
Question: Find the greatest number that divides 74, 116 and 158 leaving the same remainder in each case.
- Differences: 116 − 74 = 42 and 158 − 116 = 42.
- HCF(42, 42) = 42.
- Check: 74 = 42 × 1 + 32, 116 = 42 × 2 + 32, 158 = 42 × 3 + 32.
Answer: 42, with remainder 32
Example 2
Question: Find the greatest number that divides 1657 and 2037 leaving remainders 6 and 5 respectively.
- Subtract the remainders: 1657 − 6 = 1651 and 2037 − 5 = 2032.
- 1651 = 13 × 127 and 2032 = 16 × 127, so HCF = 127.
Answer: 127
Example 3
Question: Find the greatest number that divides 90 and 142 leaving the same remainder.
- Difference: 142 − 90 = 52.
- The greatest divisor is 52 itself.
- Remainder: 90 ÷ 52 leaves 38, and 142 ÷ 52 leaves 38.
Answer: 52, with remainder 38
Example 4
Question: Find the greatest number that divides 43, 91 and 183 leaving the same remainder.
- Differences: 91 − 43 = 48 and 183 − 91 = 92.
- HCF(48, 92) = 4.
- Remainder: 43 ÷ 4 leaves 3; 91 ÷ 4 leaves 3; 183 ÷ 4 leaves 3.
Answer: 4, with remainder 3
Example 5
Question: Find the greatest number that divides 1305, 4665 and 6905 leaving the same remainder.
- Differences: 4665 − 1305 = 3360 and 6905 − 4665 = 2240.
- 3360 = 3 × 1120 and 2240 = 2 × 1120, so HCF = 1120.
Answer: 1120
Shortcuts and Tricks
- Do not compute the remainder first; subtract the numbers and take the HCF of the differences.
- For three numbers, only two differences are needed (consecutive ones).
- If the differences are equal, that difference is the answer.
- After finding d, compute the remainder as one given number modulo d to confirm.
- If remainders are different and given, use the subtraction method of Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders instead.
Common Mistakes
- Taking the HCF of the numbers themselves instead of their differences.
- Using the LCM of the differences.
- Forgetting to check that the remainder is smaller than the divisor.
- Using the method when the remainders are given as different values.
- Subtracting in the wrong order and getting negative differences; use absolute values.
Practice Questions
- Greatest number dividing 55 and 91 with the same remainder.
- Greatest number dividing 28, 43 and 73 with the same remainder.
- Greatest number dividing 25, 49 and 73 with the same remainder.
- Greatest number dividing 100 and 160 with the same remainder.
- What is the remainder when 55 is divided by 36?
Answers: 1) 36; 2) 15; 3) 24; 4) 60; 5) 19.
Why Is This Topic Important?
- Frequent Greatest-divisor problems appear in SSC CGL.
- Shortcut Differences make the remainder disappear.
- Pairs with Least Number Divisible by Given Numbers Leaving a Specified Common Remainder uses the LCM; this topic uses the HCF.
- Foundation The congruence idea is used in remainder theorems later.
What Comes Next?
The next topic is Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders, which finds the greatest number that divides given numbers leaving specified remainders.
Key Terms and Formulas
- Difference The result of subtracting one number from another
- HCF of differences The greatest divisor leaving equal remainders
- Remainder What is left after the division
- Divisor The number you divide by
- Quotient The whole-number result of division
- Cancel Equal remainders vanish in a difference
Related Topics
- Least Number Divisible by Given Numbers Leaving a Specified Common Remainder
- Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders
- Highest Common Factor (HCF) by Division and Prime Factorization Method
- Lowest Common Multiple (LCM) by Division and Prime Factorization Method
Exam Corner
Points to Remember
- Greatest number leaving the same remainder = HCF of the differences.
- The remainder is any given number modulo that divisor.
- The remainder must be less than the divisor.
- For three numbers use two differences.
- Equal differences give the answer directly.
Do Not Confuse With
- Differences vs the numbers Take the HCF of the differences, not of the numbers.
- HCF vs LCM Greatest divisor uses HCF; least number uses LCM.
- Same vs specified remainder Same remainder uses differences; specified remainders use subtraction (next topic).
- Divisor vs remainder The remainder is smaller than the divisor.
Memory Hook
Same remainder: subtract the numbers, then take the HCF of the differences.
GS Relevance
Frequently Asked Questions
How do you find the greatest number leaving the same remainder?
To find the greatest number that divides given numbers leaving the same remainder, find the differences between the numbers and take the HCF of those differences. For 74, 116 and 158 the differences are 42 and 42, so the greatest number is 42, and the remainder is 32.
Why does the HCF of differences work?
The HCF of differences works because if two numbers leave the same remainder with a divisor, their difference is a multiple of that divisor, since the remainders cancel. So the divisor divides every difference, and the greatest such divisor is the HCF of the differences.
How do you find the remainder after finding the divisor?
After finding the greatest divisor, divide any one of the given numbers by it and take the remainder. For 74, 116 and 158 with divisor 42, dividing 74 by 42 leaves 32, and dividing 116 or 158 by 42 also leaves 32, which confirms the remainder.
How many differences are needed for three numbers?
For three numbers, two differences are enough, usually between consecutive numbers, because the third difference is the sum of the first two and adds nothing new. For 43, 91 and 183 the differences are 48 and 92, and their HCF is 4.
What if the remainders are different in the question?
If the remainders are given and different, the difference method does not apply directly. Instead, subtract each remainder from its number and take the HCF of the results. For 1657 and 2037 with remainders 6 and 5, the HCF of 1651 and 2032 is 127.
PYQ Practice — Statement Analysis
1 The greatest number that divides 55 and 91 leaving the same remainder is 36.
The difference is 36 and both leave remainder 19.
2 The greatest number leaving the same remainder is the HCF of the numbers themselves.
It is the HCF of the differences between the numbers.
3 If two numbers leave the same remainder with d, their difference is a multiple of d.
The equal remainders cancel in the subtraction.
4 The LCM of the differences gives the greatest such divisor.
The HCF of the differences gives it.
Related Topics
Browse the full Quantitative Aptitude index