Question

Refer to the attachment please. ​

Answer 1

Answer:

Recall that the Greatest Common Divisor (GCD) of two integers A and B is the largest integer that divides both A and B. The Euclidean Algorithm is a technique for quickly finding the GCD of two integers.

...

Proof that the GCD(B,C) evenly divides A

B+C=A.

M⋅GCD(B,C) + N⋅GCD(B,C) = A.

(M + N)⋅GCD(B,C) = A.

Answer 2

Answer:

The GCD of two numbers is the largest positive integer that divides both the numbers fully i.e. without any remainder. Euclid's algorithm is an efficient way to find the GCD of two numbers and it's pretty easy to implement using recursion in the Java program.

HOPE THIS WILL HELP