#5 (a) Complete the Sagemath/Python code below to print the table while implementing the Euclidean algorithm. Add code where indicated and explain why the marked statements are necessary. Show the output below the code. def EuclidGCDtable (a,b): "print table while finding GCD" print("\n a b q r = 1 while r>0: q= (add code here) r = (add code here) print("%4d %4d %4d %4d"%(a,b,q,r),end=' ') if r=-0: print () a = b; b = r r") #why is this necessary? output here print("gcd", b) return b for a,b in [(660,350), (99,53), (30,84)]: EuclidGCDtable(a,b) #why is this necessary? (b) create a new function EuclidGCD (a, b) without the print statements and show that it gives the same results as pfGCD (a, b). The following code will help print the test output. answer for a,b in [(660,350), (99,53), (30,84)]: print("gcd (%d,%d) =" % (a,b),end=' ') print (EuclidGCD (a,b), "from Euclid, and", end=' ') print (pfGCD (a,b), "from prime factor")

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%
#5 (a) Complete the Sagemath/Python code below to print the table while implementing the
Euclidean algorithm. Add code where indicated and explain why the marked statements are
necessary. Show the output below the code.
def EuclidGCDtable (a,b):
"print table while finding GCD"
print("\n a b q
r = 1
while r>0:
q= (add code here)
r = (add code here)
print("%4d %4d %4d %4d"%(a,b,q,r),end=' ')
if r=-0:
print ()
a = b; b = r
r")
#why is this necessary?
output here
print("gcd", b)
return b
for a,b in [(660,350), (99,53), (30,84)]:
EuclidGCDtable(a,b)
#why is this necessary?
answer
(b) create a new function EuclidGCD (a, b) without the print statements and show that it gives
the same results as pfGCD (a, b). The following code will help print the test output.
for a,b in [(660,350), (99,53), (30,84)]:
print("gcd (%d,%d) =" % (a,b), end=' ')
print (EuclidGCD (a,b), "from Euclid, and", end=' ')
print (pfGCD (a, b), "from prime factor")
Transcribed Image Text:#5 (a) Complete the Sagemath/Python code below to print the table while implementing the Euclidean algorithm. Add code where indicated and explain why the marked statements are necessary. Show the output below the code. def EuclidGCDtable (a,b): "print table while finding GCD" print("\n a b q r = 1 while r>0: q= (add code here) r = (add code here) print("%4d %4d %4d %4d"%(a,b,q,r),end=' ') if r=-0: print () a = b; b = r r") #why is this necessary? output here print("gcd", b) return b for a,b in [(660,350), (99,53), (30,84)]: EuclidGCDtable(a,b) #why is this necessary? answer (b) create a new function EuclidGCD (a, b) without the print statements and show that it gives the same results as pfGCD (a, b). The following code will help print the test output. for a,b in [(660,350), (99,53), (30,84)]: print("gcd (%d,%d) =" % (a,b), end=' ') print (EuclidGCD (a,b), "from Euclid, and", end=' ') print (pfGCD (a, b), "from prime factor")
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY