Correct option is B
Given:
When the number divides 285, remainder = 9
When the number divides 1249, remainder = 7
Solution:
The numbers are given by the difference exactly divisible by the required number are given as:
285 – 9 = 276
1249 – 7 = 1242
To find the greatest number that exactly divides these are given by their H.C.F:
HCF(276, 1242) using Euclidean Algorithm:
1242 ÷ 276 = 4 remainder 138
276 ÷ 138 = 2 remainder 0
So, HCF = 138