Question

State the Euclidean algorithm. using the above algorithm find greatest common divisor of 6237 and 2520.

Answer 1

Given positive integers a and b there exist unique integers q and r satisfying a=b.q+r
where 0 <or_r<b
GCD means HCF
HCF of 6237 and 2520 is