Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Euclidean Algorithm

    Uploaded by

    Medishetty Yeshvanth
    The document describes finding the greatest common divisor (GCD) of two numbers using the Euclidean algorithm. It provides the programming code for a function that takes two integers as input, uses a recursive approach to apply the Euclidean algorithm, and returns the GCD. The code is tested by prompting the user to input two numbers and printing the GCD of those numbers.

    Copyright:

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

    You might also like

    Euclidean Algorithm

    Uploaded by

    Medishetty Yeshvanth
    17 views3 pages
    The document describes finding the greatest common divisor (GCD) of two numbers using the Euclidean algorithm. It provides the programming code for a function that takes two integers as input, uses a recursive approach to apply the Euclidean algorithm, and returns the GCD. The code is tested by prompting the user to input two numbers and printing the GCD of those numbers.

    Original Description:

    Original Title

    Euclidean algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes finding the greatest common divisor (GCD) of two numbers using the Euclidean algorithm. It provides the programming code for a function that takes two integers as input, uses a recursive approach to apply the Euclidean algorithm, and returns the GCD. The code is tested by prompting the user to input two numbers and printing the GCD of those numbers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    17 views3 pages

    Euclidean Algorithm

    Uploaded by

    Medishetty Yeshvanth
    The document describes finding the greatest common divisor (GCD) of two numbers using the Euclidean algorithm. It provides the programming code for a function that takes two integers as input, uses a recursive approach to apply the Euclidean algorithm, and returns the GCD. The code is tested by prompting the user to input two numbers and printing the GCD of those numbers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    Number theory

    Euclidean algorithm

    Submitted by:
    Medishetty yashwanth(2020btechcse108)

    Submitted to:
    Manushi guptha

    Institute of engineering and technology


    Jk lakshmipat university
    January 2023
    Aim: To find the gcd of two numbers using Euclid’s algorithm.

    Programming code:

    def GCDEuclidsAlgo(x,y):
    if y == 0:
    return x
    else:
    return GCDEuclidsAlgo(y,x%y)
    a = int(input("a:"))
    b = int(input("b:"))
    print("GCD of",a,"&",b,"=",GCDEuclidsAlgo(a,b))

    Result:

    You might also like