Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm.
(a) 13
(b) 12
(c) 17
(d) 7
This question was posed to me during an internship interview.
I want to ask this question from Number Theory in division Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security