Question

please help with python

EDIT: hmwk3q3 is just what the file is supposed to be named

Greatest Common Divisor Two integers A and B have the greatest common divisor which is the largest positive integer that divides A and B, evenly, without a remainder. One way to find the Greatest Common Divisor is to consider the prime factors for A = 372 and B = 84 as shown below. 372 = 22 * 3 31 84 = 22 +3 : 7 GCD (372,84) = 22 + 3 = 12 In a well-documented Python program, hmwk303.py, query the user for two integers. Use a while-loop to find the remainder R when dividing A by B.Replace the value of A with the value of with the value of B and replace the value of B with the value of R. Continue this process within the while-loop until the value of B is zero. At that time the value of A will be the GCD. In a comment, provide the response to your program when A = 98,025,733,547 and B = 2,345,109,894,323. Grading Comments (+2 points). Input software to query for A and B (+2 points). A correct while-loop (+4 points). The correct value for GCD (+2 points).

Answer 1

Was this answer helpful? bo mo Debjit answered this 1,179 answers SOURCE CODE IN PYTHON: #input A Arint(input('Enter first number: ')) #input B Brint(input('Enter second number: ')) #calculating GCD while B!=0: #remainder of A divided by B REA%B #updating A and B A=B BER #output print('GCD is %d' %(A)) #output for 98025733547 and 2345109894323 is 7 1 input A A-int(input('Enter first number: ')) #input B B-int(input('Enter second number: *) #calculating GCD while B!=0: #remainder of A divided by B REA%B #updating A and B A=B BER Houtput print("GCD is %d %(A)) 13 14 15 output for 98825733547 and 2345109894323 is 7 OUTPUT: Enter first number: 98025733547 Enter second number: 2345109894323 GCD is 7

Answer 2

def gcd(x, y):    while y != 0:
        (x, y) = (y, x % y)    return x