Scribd Logo
Upload

Welcome to Scribd!

  • Angelriya 5 B

    Uploaded by

    Satish Jadhav
    8 views1 page
    This Python code defines a recursive function called gcd that finds the greatest common divisor of two integers a and b. It takes in two numbers as input, calls the gcd function, and prints out the GCD of the two numbers.

    Original Description:

    Original Title

    angelriya-5-B

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Python code defines a recursive function called gcd that finds the greatest common divisor of two integers a and b. It takes in two numbers as input, calls the gcd function, and prints out the GCD of the two numbers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Angelriya 5 B

    Uploaded by

    Satish Jadhav
    This Python code defines a recursive function called gcd that finds the greatest common divisor of two integers a and b. It takes in two numbers as input, calls the gcd function, and prints out the GCD of the two numbers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Practical-5B

    Code-def gcd(a,b):

    if(b==0):

    return a

    else:

    return gcd(b,a%b)

    print("Find GCD of 2 numbers")

    a=int(input("Enter 1st number: "))

    b=int(input("Enter 2nd number: "))

    GCD=gcd(a,b)

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

    Output-

    You might also like