find the greatest numbers which divideds 285 and 1249 leaving remainders 9 and 7 respectively
Answers
Answered by
0
• let us first subtract the remainders from the numbers
285-9 ==> 276
1249-7 ==> 1242
• now let the greatest number that is able to divide them be x , and as we subtracted the remainders 276 and 1242 are multiples of x
• now find the HCF of 276 and 1242 which is 138 //
( to find HCF , use Euclid’s Division Formula or the usual prime factorisation method )
285-9 ==> 276
1249-7 ==> 1242
• now let the greatest number that is able to divide them be x , and as we subtracted the remainders 276 and 1242 are multiples of x
• now find the HCF of 276 and 1242 which is 138 //
( to find HCF , use Euclid’s Division Formula or the usual prime factorisation method )
Similar questions