Advanced Search

Question: How do I solve an Euclidean algorithm on maple

Question:How do I solve an Euclidean algorithm on maple

Tima222 65 Maple 2018
October 14 2019
4

 

 

For given positive integers 𝑎 and 𝑏, there exist positive integers 𝑟 and 𝑠 (the so-called Bezout’s coefficients) so that 𝑔𝑐𝑑(𝑎,𝑏)=𝑟 𝑎+𝑠 𝑏. Using Euclidean algorithm, one can find these coefficients by using a forward and a backward substitution. Surf the web, let say this one https://brilliant.org/wiki/bezouts-identity/, or use any Discreet Mathematics textbook to find out how these coefficient can be computed using Euclidean algorithm. Now, write a code in Maple to compute Bezout’s coefficients for the numbers 18344 and 65208. 
Please Wait...