Solution for Section 3.9 Question 3

3. First apply the Euclidean Algorithm to 115 and 35 to find gcd(115, 35).

115

=

35 · 3 + 10
35 = 10 · 3 + 5
10 = 5 · 2 + 0

Thus, gcd(115, 35) = 5. Since 5notdiv.jpg (589 bytes)11, there is no solution to the linear Diophantine equation 115x + 35y = 11.

Back to Section 3.9