The correct option is B False
By Euclid's division algorithm
b = aq+r,0≤r<a [∴ dividend = divisor×quotient + remainder]
⇒ 117=65×1+52
⇒ 65=52×1+13
⇒ 52=13×4+0
∴ HCF (65, 117) = 13
Also, given that, HCF (65 117) = 65 m - 117
From Eqs. (i) and (ii)
65m - 117 = 13
65m = 130
m = 2