11. Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7
respectively.
12. Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and
Answers
Answered by
2
11.Required no is 138
12.Required no is 1
Step-by-step explanation:
11.Since the remainders are 9and 7respectively the required no is the HCF of the number 285-9=276,1249-7=1242.
Hence ,we will determine the HCF of 276 and 1242.Using Euclid's Division Algorithm,We have
a=bq+r here a=dividend ,b=divisor,
q=quotient and r=remainder
1242=276×4+138
276=138×2+0
Therefore, HCF of 276,1242=138 and so the required number is 138
12.Since the remainder is 4 respectively, the required no is the HCF of the number
280-4=276,1245-4=1241.
Hence ,we will determine the HCF of 276 and 1241.Using Euclid's Division Algorithm,We have
a=bq+r
1241=276×4+137
276=137×2+2
137=2×68+1
2=1×2+0
Therefore, HCF of 276,1241=1 and so the required number is 1
Plz mark as brainly answer
I hope that you will able to understand the steps
Similar questions