Pages that link to "Item:Q2856455"

The following pages link to The Euclidean Algorithm and the Linear Diophantine Equation <em>ax</em> + <em>by</em> = gcd(<em>a</em>, <em>b</em>) (Q2856455):

Displaying 4 items.

• The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\) (Q2363604) (← links)
• The restricted solutions of \(ax+by=\gcd(a,b)\) (Q2518181) (← links)
• A bagatelle on Euclid's algorithm (EWD 1158) (Q4885867) (← links)
• The Euclidean algorithm as a sequence of modular inverse switching formulas (Q6542783) (← links)