Following the idea of Exercise 6 and referring to Exercise 7, express the positive gcd of 49,349
Question:
Following the idea of Exercise 6 and referring to Exercise 7, express the positive gcd of 49,349 and 15,555 in Z in the form λ(49,349) + µ,(15,555) for λ, µ, ∈ Z.
Data from Exercise 6
By referring to Example 46.11, actually express the gcd 23 in the form λ(22,471) + µ,(3,266) for λ,µ, ∈ Z.
Data from in Example 46.11
Note that the division algorithm Condition 1 in the definition of a Euclidean norm says nothing about r being "positive." In computing a gcd in Z by the Euclidean algorithm for ||, as in Example 46.10, it is surely to our interest to make |ri| as small as possible in each division. Thus, repeating Example 46.10, it would be more efficient to write
We can change the sign of ri from negative to positive when we wish since the divisors of ri and -ri are the same.
Step by Step Answer: