Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm |
scientific article |
Statements
Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (English)
0 references
13 February 2018
0 references
Euclidean algorithm
0 references
extended Euclidean algorithm
0 references
\(k\)-ary GCD algorithm
0 references
calculation of inverse elements by module
0 references
