1. Engineering
  2. Computer Science
  3. instructions ent the extended euclidean algorithm to find the greatest...

Question: instructions ent the extended euclidean algorithm to find the greatest...

Question details

Instructions ent the extended Euclidean algorithm to find the greatest common divisor of any two positive integers a and b, as well as values for s and t such that s xa +t xb gcdla,b). It should also provide an accurate response if the user enters a zero It should implement the pseudocode provided in the text. It should allow the user to enter two integers a and b Your program should output the intermediate values of q, r, r1, r2, s, st, s2,t, t1, and 12 for each step. It should return the greatest common divisor and values for s and t Challenge task: Provide error checking to confirm that the input is not negative. This is an individual assignment. Upload the following. 1) a file of the code 2) screenshots of output for at least 4 pairs of inputs. Submit Assignment Files to submit (0) file(s) to submit DOLL F9 F10 F11 F12 F7 Fe FS 8 7 5 6 8
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution