The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\)
From MaRDI portal
Publication:2363604
DOI10.1007/s00283-016-9664-zzbMath1429.11217OpenAlexW2579790489MaRDI QIDQ2363604
Publication date: 25 July 2017
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00283-016-9664-z
Arithmetic theory of polynomial rings over finite fields (11T55) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Cites Work