FIFA-2022 Career Guide Free Tutorials Go to Your University Placement Preparation 
0 like 0 dislike
10.7k views

1 Answer

0 like 0 dislike
by Goeduhub's Expert (5.8k points)
edited by
 
Best answer

Greatest Common Divisor (GCD) is the largest possible integer, that divides both of the integers, condition is that the numbers must be non-zero.

Method 1 using in-built method 

import math

a=int(input("Enter first number:"))

b=int(input("Enter second number:"))

print("GCD of ",a," and ",b,"is:",math.gcd(a,b))

Output

Enter first number:60
Enter second number:48
GCD of 60 and 48 is: 12

Method 2 using Recursion

def gcd(a,b):

    if(b==0):

        return a

    else:

        return gcd(b,a%b)

a=int(input("Enter first number:"))

b=int(input("Enter second number:"))

GCD=gcd(a,b)

print("GCD of ",a," and ",b,"is:",GCD)

Output

Enter first number:60 

Enter second number:48 

GCD of 60 and 48 is: 12


For more RGPV/UTMP CSE V Sem Python Lab Experiments Click here


Click Here to go to all Universities Python Lab Index Pages.

Learn & Improve In-Demand Data Skills Online in this Summer With  These High Quality Courses[Recommended by GOEDUHUB]:-

Best Data Science Online Courses[Lists] on:-

Claim your 10 Days FREE Trial for Pluralsight.

Best Data Science Courses on Datacamp
Best Data Science Courses on Coursera
Best Data Science Courses on Udemy
Best Data Science Courses on Pluralsight
Best Data Science Courses & Microdegrees on Udacity
Best Artificial Intelligence[AI] Courses on Coursera
Best Machine Learning[ML] Courses on Coursera
Best Python Programming Courses on Coursera
Best Artificial Intelligence[AI] Courses on Udemy
Best Python Programming Courses on Udemy

Related questions

 Important Lists:

Important Lists, Exams & Cutoffs Exams after Graduation PSUs

 Goeduhub:

About Us | Contact Us || Terms & Conditions | Privacy Policy ||  Youtube Channel || Telegram Channel © goeduhub.com Social::   |  | 

 

Free Online Directory

...