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
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>) |
scientific article; zbMATH DE number 6220560
| 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; zbMATH DE number 6220560 |
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
0.7679809331893921
0 references
0.7226945161819458
0 references
