scientific article; zbMATH DE number 910709

MaRDI QIDQ4885867zbMATH OpenFDO

Authors Edsger W. Dijkstra

Publication date 25 March 1997

zbMATH Keywords

loop invariantsEuclid's algorithmlinear diophantine equations

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Linear Diophantine equations (11D04)

Recommendations

• The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\)
• Euclid's Algorithm = Reverse Gaussian Elimination
• On the complexity of the extended Euclidean algorithm (extended abstract)
• Euclid's algorithm, Guass' elimination and Buchberger's algorithm
• scientific article; zbMATH DE number 3853179

Cited in

(7)

• Identities and inequalities derived from Euclid's algorithm with applications in cutting-covering receipts
• The Generalized Towers of Hanoi Problem
• Euclid's Algorithm = Reverse Gaussian Elimination
• Designing an algorithmic proof of the two-squares theorem
• Dancing elves and a flower’s view of euclid’s algorithm
• Extended Euclid's Algorithm via Backward Recurrence Relations
• The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885867)