Unformatted text preview: 407 mod 74 = 37 74 mod 37 = 0 , so gcd (3478 ; 2183) = 37 3. Find integers x and y so that 77 x + 144 y = gcd (77 ; 144) . The table for the Euclidean algorithm is 77 x + 144 y x y q 144 1 77 1 1 67 & 1 1 1 10 2 & 1 6 7 & 13 7 1 3 15 & 8 2 1 & 43 23 so gcd (77 : 144) = 1 and 77 ( & 43) + 144 (23) = 1 ....
View
Full Document
 Spring '08
 STAFF
 Remainder, Prime number, Greatest common divisor, Euclidean algorithm, Euclidean domain

Click to edit the document details