The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>)

DOI10.4169/amer.math.monthly.120.06.562zbMath1279.11028OpenAlexW2402528903WikidataQ58121803 ScholiaQ58121803MaRDI QIDQ2856455

Stuart A. Rankin

Publication date: 29 October 2013

Published in: The 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

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

Related Items (1)

The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\)

This page was built for publication: The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>)