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.
Euclidean Algorithm(p. 102)To find gcd(a, b) where b < a:Divide b into a and let r 1 be the remainder.Divide r 1 into b and let r 2 be the remainder.Divide r 2 into r 1 and let r 3 be theremainder.Continue to divide the remainder into thedivisor until you get a remainder of zero.gcd(a, b) the last nonzero remainder.
Change language