The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\) (Q2363604)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\) |
scientific article |
Statements
The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\) (English)
0 references
25 July 2017
0 references
From the text: ``In this article we examine a polynomial version of the Euclidean Algorithm and discuss solutions to the polynomial equation \(AX + BY = \gcd(A,B)\) over a finite field. We discover that the distribution of solutions to the polynomial equation mirrors the distribution of solutions to the corresponding integer equation, but with intriguing differences as well.'' See also the authors' related article (with K. Hicks) [Math. Intell. 27, No. 2, 26--34 (2005; Zbl 1189.11055)].
0 references
