The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\) (Q2856455)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 6220560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\) |
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.7401121854782104
0 references
0.7323698401451111
0 references
0.7226945161819458
0 references
