Diophantine equations for integers.
Diophantine equations for integers.
Diophantine equations for integers.
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Using Division and Euclidean Algorithms toSolve <strong>Diophantine</strong> EquationsTo solve ax + by c:1. Use the Division Algorithm to find d=gcd(a,b).2. Use the Euclidean Algorithm to find x* and y*such that d ax* + by*.3. Find p such that c dp. (p exists since d │c.)4. Then x o x*p and y o y*p are solutions since c dp a(x*p) + b(y*p).
Change language