Question: please do this in python 3.8 without numpy Question 3 (10 Points) Greatest Common Divisor Two integers A and B have the greatest common divisor

please do this in python 3.8 without numpy

please do this in python 3.8 without numpy Question 3 (10 Points)

Question 3 (10 Points) 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, hmwk3Q3.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 B and replace the value of B with the value of R. Continue this process within the while-loop until the value of Bis 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)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

please do this in python 3.8 without numpy Question 1 (10 Points) Gravity and Electric Forces (Using Lists) The formulae for Gravity F, and Electric forces between two objects with masses m. m, and...

USING C CODE PLEASE add comments for every line please As we discussed in class, recursion is a very useful programming technique in which a function makes a call to itself. Such a call is described...

USING C programming Program 1 Some General Recursive Algorithms As we discussed in class, recursion is a very useful programming technique in which a function makes a call to itself. Such a call is...

3. In last Time, we studied Euclid's algorithm for computing the greatest common divisor (ged) of two positive integers: the largest integer which divides them both. Here we wll look at an...

please provide this program in java thank you. Lab Exercise 1.Finding the Greatest Common Divisor Problem: Write a program that prompts the user to enter two positive integers and finds their...

Marks for this question: 12 meets The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid's algorithm can be used to...

Please write in C++. Will rate "thumbs up." Thank you! 1. The Greatest Common Divisor (GCD) The greatest common divisor (GCD) of two integers is the largest integer that evenly divides each of the...

The greatest common divisor of two positive integers is the largest number which divides into them both evenly, i.e., with a remainder of O. For example, the greatest common divisor of 9 and 12 is 3,...

C++ The Greatest Common Divisor (gcd) of two or more (consider only positive non-zero) integers is the largest positive integer that divides the numbers without a remainder. For instance, the GCD of...

Kyle's Competing Job Offers. Kyle, after an arduous post-graduation job search, has received an offer of the following three different country posts with a major multinational company. Each of the...

Interview Martin Kings Man and write a paper in which you address the following: Summarize the views of the law enforcement professional you interviewed in regard to the tools used in intelligence...

Null Identity II grad * g r a d vec ( A ) = 0

CT Corp Comprehensive Question Canadian Tire Corporation, Limited (Canadian Tire) is a family of companies that includes a retail segment and a financial services division, among others. The retail...

social control based on persuasion and appeal to sense of guilt in transgressing social norms.

politeness and modesty, as well as indirectness;

making the best of things and playing the game right, not necessarily to win, but to see fair play;