Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Class 3

    Uploaded by

    Dr K Rajendra Prasad
    The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers. For example, the GCD of 12 and 33 is 3, as 3 is the largest number that divides both 12 and 33. The Euclid algorithm is a method that can be used to efficiently calculate the GCD of two numbers by repeatedly dividing the larger number by the smaller number and setting the smaller number equal to the remainder, until the remainder is zero.

    Copyright:

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

    You might also like

    Class 3

    Uploaded by

    Dr K Rajendra Prasad
    5 views1 page
    The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers. For example, the GCD of 12 and 33 is 3, as 3 is the largest number that divides both 12 and 33. The Euclid algorithm is a method that can be used to efficiently calculate the GCD of two numbers by repeatedly dividing the larger number by the smaller number and setting the smaller number equal to the remainder, until the remainder is zero.

    Original Description:

    MFCS

    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 greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers. For example, the GCD of 12 and 33 is 3, as 3 is the largest number that divides both 12 and 33. The Euclid algorithm is a method that can be used to efficiently calculate the GCD of two numbers by repeatedly dividing the larger number by the smaller number and setting the smaller number equal to the remainder, until the remainder is zero.

    Copyright:

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

    Class 3

    Uploaded by

    Dr K Rajendra Prasad
    The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers. For example, the GCD of 12 and 33 is 3, as 3 is the largest number that divides both 12 and 33. The Euclid algorithm is a method that can be used to efficiently calculate the GCD of two numbers by repeatedly dividing the larger number by the smaller number and setting the smaller number equal to the remainder, until the remainder is zero.

    Copyright:

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

    Greatest Common Divisor

    The integer a is a common divisor of b and c in case a | b and a | c. Since there is only a finite
    number of divisors of any nonzero integer, there is only a finite number of common divisors of
    b and c, except in the case b = c = 0.
    If at least one of b and c is not 0, the greatest among their common divisors is called the greatest
    common divisor of b and c and is denoted by (b, c)
    GCD is the greatest positive number which is a common divisor for a given set of positive
    numbers.
    Understanding the GCD with an example
    12 33
    Divisors 1, 2, 3, 4, 6, 12 1, 3, 11, 33
    Common Divisors 1, 3 1, 3
    Greatest Common Divisors 3
    (GCD)

    Understanding the GCD with an example Using Euclid Algorithm Ex: gcd(12,33)

    Q A B R
    2 33 12 9
    1 12 9 3
    3 9 3 0
    - 3 0 -

    Therefore, gcd(12,33)=3
    Exercises on gcd:
    1. Find the gcd(1160718174, 316258250)
    2. Find the gcd for the linear equation 60x + 22y =gcd(60, 22)
    3. Solve the gcd(54321,9876) using Euclid algorithm

    You might also like