Question

In: Computer Science

11. Use Euclid’s extended algorithm to find x and y for Gcd(241, 191) = 241 x...

11. Use Euclid’s extended algorithm to find x and y for Gcd(241, 191) = 241 x + 191 y

Show all work.

Solutions

Expert Solution

Use Euclid’s extended algorithm to find x and y for Gcd(241, 191) = 241 x + 191 y

Show all work.

First find the GCD(241,191)

   using Euclidean Algorithm

   241 = 1 * 191 + 50
  
   191 = 3 * 50 + 41

   50 = 1 * 41 + 9

   41 = 4 * 9 + 5

   9 = 1* 5 + 4

   5 = 1 * 4 + 1

   4 =4 * 1 + 0

   Therefore GCD(241,191) =1


By reversing the steps in the Euclidean Algorithm, it is possible to find these integers x and y

Starting with the next to last line, we have:

1 = 5 - 1(4) ---> main equation

From the line before that, we see that 4 = 9 - 1(5)

substituting the value of 4 in main equation

we get the main equation as,

1 = 5 - 1( 9 - 1(5))

1 = 2(5) - 9 ---> main equation

from reverse steps, we get the 5 as

5 = 41 - 4(9)

substituting the value of 5 in main equation we get

1 = 2(41 - 4(9)) - 9

1 = 2(41) - 9(9)

continuing the above process for the remaining steps

9 = 50 - 1(41)

1 = 2(41) - 9(50 - 1(41))

1 = 11(41) - 9(50)

41 = 191 - 3(50)

1 = 11(191 - 3(50)) - 9(50)

1 = 11(191) -42(50)

50 = 241 - 1(191)

1= 11(191) - 42( 241 - 1(191))

1=53(191) - 42(241)

Therefore x = -42
                 y = 53

`  

   


Related Solutions

Use Euclid’s algorithm to find integers x, y and d for which 3936 x + 1293...
Use Euclid’s algorithm to find integers x, y and d for which 3936 x + 1293 y = d is the smallest possible positive integer. Using your answers to this as your starting point, do the following tasks. (a) Find a solution of 3936 x ≡ d mod 1293. (b) Find an integer r that has the property that r ≡ d mod 1293 and r ≡ 0 mod 3936. (c) Find an integer R that has the property that...
Use Euclid’s algorithm to find integers x, y and d for which 3936x + 1293y =...
Use Euclid’s algorithm to find integers x, y and d for which 3936x + 1293y = d is the smallest possible positive integer. Using your answers to this as your starting point, do the following tasks. (a)Find an integer s that has the property that s ≡ d mod 3936 and s ≡ 0 mod 1293. (b) Find an integer S that has the property that S ≡ 573 mod 3936 and S ≡ 0 mod 1293. (c) Find an...
find a linear combination for gcd(259,313). use extended euclidean algorithm. what is inverse of 259 in...
find a linear combination for gcd(259,313). use extended euclidean algorithm. what is inverse of 259 in z subscript 313? what is inverse of 313 in z subscript 259?
Find the largest number of divisions made by Euclid’s algorithm for computing gcd(m, n) for 1≤...
Find the largest number of divisions made by Euclid’s algorithm for computing gcd(m, n) for 1≤ n ≤ m ≤ 100.
a. Using the Euclidean Algorithm and Extended Euclidean Algorithm, show that gcd(99; 5) = 1 and...
a. Using the Euclidean Algorithm and Extended Euclidean Algorithm, show that gcd(99; 5) = 1 and find integers s1 and t1 such that 5s1 + 99t1 = 1. [Hint: You should find that 5(20) + 99(?1) = 1] b. Solve the congruence 5x 17 (mod 99) c. Using the Chinese Remainder Theorem, solve the congruence x 3 (mod 5) x 42 (mod 99) d. Using the Chinese Remainder Theorem, solve the congruence x 3 (mod 5) x 6 (mod 9)...
Use the Euclidean algorithm to find the GCD of 3 + 9i and 7-i
Use the Euclidean algorithm to find the GCD of 3 + 9i and 7-i
Use the Extended Euclid's Algorithm to solve ƒ-1  for 8 mod 11
Use the Extended Euclid's Algorithm to solve ƒ-1  for 8 mod 11
Find the GCD (5796852, 4585268) using the Euclidian Algorithm..
Find the GCD (5796852, 4585268) using the Euclidian Algorithm..
Find the GCD (5796852, 4585268) using the Euclidian Algorithm..
Find the GCD (5796852, 4585268) using the Euclidian Algorithm..
1. Use the Extended Euclid's Algorithm to solve ƒ-1 for 8 mod 11 2. Use the...
1. Use the Extended Euclid's Algorithm to solve ƒ-1 for 8 mod 11 2. Use the max function to calculate max3(x, y, z) if x = 2, y = 6, z = 5. Show your work!
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT