The Euclidean algorithm and the linear Diophantine equation ax+by=(a,b)

DOI10.4169/AMER.MATH.MONTHLY.120.06.562MaRDI QIDQ2856455zbMATH OpenOpenAlexWikidataFDO

Authors Stuart A. Rankin

Publication date 29 October 2013

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.120.06.562

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Linear Diophantine equations (11D04)

Recommendations

• scientific article; zbMATH DE number 910709
• scientific article; zbMATH DE number 3853179
• The extended Euclidean algorithm provides optimal Bézout numbers
• Euclid's Algorithm = Reverse Gaussian Elimination
• Solution to a linear diophantine equation for nonnegative integers

Cited in

(4)

• The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\)
• The restricted solutions of \(ax+by=\gcd(a,b)\)
• scientific article; zbMATH DE number 910709 (Why is no real title available?)
• The Euclidean algorithm as a sequence of modular inverse switching formulas

This page was built for publication: The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\)

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