Let m be the gcd of 117 and 299. Find m using the Euclidean algorithm
Answers
Answered by
1
Answer:
gcd(m) = 13
Explanation:
a > b
a = 299
b = 117
a = b * q + r
299 = 117 * 2 + 65
117 = 65 * 1 + 52
65 = 52 * 1 + 13
52 = 13 * 4 + 0
gcd = 13
Similar questions