+2 votes
in Class 10 by kratos

Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.

1 Answer

+4 votes
by kratos
 
Best answer

The require number when divides 285 and 1249, leaves remainder 9 and 7,

this means 285 – 9 = 276 and 1249 – 7 = 1242 are completely divisible by the number
∴ The required number = HCF of 276 and 1242
By applying Euclid’* division lemma
1242 = 276 × 4 + 138
276 = 138 × 2 + 0

∴ HCF = 138
Hence remainder is = 0
Hence required number is 138

...