1. Other
  2. Other
  3. problem 2 we recall that given a b e z...

Question: problem 2 we recall that given a b e z...

Question details

Problem 2. We recall that given a, b e Z such that ab 0, we define the gcd of a and b to be the greatest integer that divides both a and b. We denote it by ged(a, b. 1. Let a, b E Z such that abメ0, We suppose that there exists u, v Z such that Prove that ged(a, b) 1 atement. Then decide if it justify your answer. For every a E Z, b E Z, and d E Z such that d > 0, (if there exists u, v E Z such that d- au +bu, then ged(a, b)-d).

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution