The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>) (Q2856455)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>) |
scientific article |
Statements
The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>) (English)
0 references
29 October 2013
0 references
