Question

Foundations of matematics question need help solving.

Q1. Consider the Diophantine equation (i). Use Euclid's Algorithm to compute ged(17,60) (ii). Determine the solvability of the Diophantine equation (iii). Use Euclidean algorithm's back substitution to find an ordered pair such that (iv). Find all solutions of the Diophantine equation (v). Find the inverse of 17 modulo 60

Answer 1

"Gcd (17, 60) 17)60(3 -51 9)17(1 -9 8)9(1 -8 1)8(8 -8 0 gcd (17, 60) = 1 (ii) we know that Diophantine equation ax + by = c is solvable if and only it and only if gcd(a, b)