Explanation:
Exp: B
2
Use Euclid's algorithm to find the HCF of 65 and 117.
By Euclid's algorithm,
b = aq + r, 0 = r < a
\(\Rightarrow\)117 = 65 × 1 + 32
\(\Rightarrow\)65 = 52 × 1 + 13
\(\Rightarrow\)52 = 13 × 4 + 0
\(\therefore\) HCF (65, 117) = 13
It is given that HCF (65, 117) = 65m - 117.
\(\Rightarrow\)65m - 117 = 13
\(\Rightarrow\)65m = 130
\(\Rightarrow\)m = 2
Hence, the correct option is option B.
Applying