|
|
|
|
|
|
|
|
|
|
Method and examples
|
|
|
|
HCF_LCM |
|
|
|
|
|
|
Problem 7 of 11 |
|
|
|
7. The greatest number that will divide , leaving respectively , as remainder.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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 |
7. The greatest number that will divide 1657 , 2772 leaving respectively 6 , 5 as remainder.
The number divides 1657 and leaves 6 as remainder
`:.` The number exactly divides 1657 - 6 = 1651
The number divides 2772 and leaves 5 as remainder
`:.` The number exactly divides 2772 - 5 = 2767
Now, we have to find HCF of `1651, 2767`
Find HCF of (1651,2767)
| | | | | | |
| | 1651 | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| | | | | | | | | | | | | | | | | | | | | | |
`:.` HCF of given numbers (1651,2767) = 1
`:.` Required number = HCF of `1651, 2767 = 1`.
|
|
|
|
|
|
|
Share this solution or page with your friends.
|
|
|
|
