Extended Euclid's Algorithm via Backward Recurrence Relations

DOI10.2307/2690887MaRDI QIDQ3153925zbMATH OpenOpenAlexFDO

Authors S. P. Glasby

Publication date 10 November 2002

Full work available at URL https://doi.org/10.2307/2690887

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Recommendations

• Euclid's Algorithm = Reverse Gaussian Elimination
• The extended Euclidean algorithm provides optimal Bézout numbers
• An alternative approach to the greatest common divisor and the Bézout's coefficients
• scientific article; zbMATH DE number 910709
• Extended Euclidean algorithm and CRT algorithm

Cited in

(4)

• The extended Euclidean algorithm provides optimal Bézout numbers
• Euclid's Algorithm = Reverse Gaussian Elimination
• The Euclidean algorithm as a sequence of modular inverse switching formulas
• Backtracking-assisted multiplication

This page was built for publication: Extended Euclid's Algorithm via Backward Recurrence Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3153925)