Question:

The GCD of 364 and 462 is

Show Hint

GCD can be found by Euclidean algorithm.
Updated On: Apr 8, 2026
  • $3$
  • $11$
  • $14$
  • $7$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Step 1: Euclidean algorithm: $462 = 364 \times 1 + 98$, $364 = 98 \times 3 + 70$, $98 = 70 \times 1 + 28$, $70 = 28 \times 2 + 14$, $28 = 14 \times 2 + 0$.}
Step 2: GCD = $14$.}
Was this answer helpful?
0
0

Top MET Questions

View More Questions