|
|
|
|
|
Method and examples
|
|
HCF_LCM |
|
|
|
Problem 4 of 11 |
|
|
4. Find the least number which when divided by leaves the same remainder in each case.
|
|
|
|
|
|
|
|
|
|
Solution
|
Solution provided by AtoZmath.com
|
|
This is demo example. Please click on Find button and solution will be displayed in Solution tab (step by step)
HCF_LCM |
4. Find the least number which when divided by 6,7, 8, 9,12 leaves the same remainder 2 in each case.
`"Required number" = ( "LCM of " 6,7,8,9,12 ) + 2 = 504 + 2 = 506`.
2 | 6 | | 7 | | 8 | | 9 | | 12 | 2 | 3 | | 7 | | 4 | | 9 | | 6 | 2 | 3 | | 7 | | 2 | | 9 | | 3 | 3 | 3 | | 7 | | 1 | | 9 | | 3 | 3 | 1 | | 7 | | 1 | | 3 | | 1 | 7 | 1 | | 7 | | 1 | | 1 | | 1 | | 1 | | 1 | | 1 | | 1 | | 1 |
LCM of 6,7,8,9,12 = 2 × 2 × 2 × 3 × 3 × 7 = 504
|
|
|
|
|
|
Share this solution or page with your friends.
|
|
|
|