The Euclidean algorithm as a sequence of modular inverse switching formulas

zbMATH Open1542.11002MaRDI QIDQ6542783

Author name not available (Why is that?)

Publication date: 23 May 2024

Published in: Integers (Search for Journal in Brave)

zbMATH Keywords

Euclidean algorithmBézout coefficients

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An algorithm for exact division
• The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>)
• Extended Euclid's Algorithm via Backward Recurrence Relations
• GCD-Free Algorithms for Computing Modular Inverses

This page was built for publication: The Euclidean algorithm as a sequence of modular inverse switching formulas

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