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. Does a solution exist to the linear Diophantine equation 115x + 35y = 11?
If no solution exists then you are finished the question.
If a solution does exist, then work backwards through the equations of the Euclidean
Algorithm to find a solution.