1) Use the Euclidean algorithm to find (752,677) and express it as a linear combination of these integers.

Note: Since you have asked multiple questions, we will solve the first question for you. If you want any specific question to be solved then please specify the question number or post only that question.

Introduction:

The following facts form the basis of the algorithm.

• GCD remains the same if we lower a larger integer by subtracting a smaller one from it. Therefore, if we repeatedly deduct the larger of two, we arrive at GCD.
• Now, if we divide the smaller number rather than subtract it, the algorithm halts when we reach the final result of 0.