Question: how to find greatest common divisor using euclidean algorithm?
Answer: B+C=A. M⋅GCD(B,C) + N⋅GCD(B,C) = A. (M + N)⋅GCD(B,C) = A.