Scribd
Upload
63 views1 page

LCM (A, B) A × B GCD (A, B) : Euclidean Algorithm

The Euclidean algorithm finds the greatest common divisor (GCD) of two numbers by repeatedly dividing the larger number by the smaller number until getting a remainder of 0. It works by taking the remainder of each division as the new number to divide the previous divisor by. The last non-zero remainder is the GCD. The document provides examples finding the GCD of 24 and 60, and 40 and 64 using this method of repeated division and recording the remainders.

Uploaded by

tigersayooj
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
63 views1 page

LCM (A, B) A × B GCD (A, B) : Euclidean Algorithm

The Euclidean algorithm finds the greatest common divisor (GCD) of two numbers by repeatedly dividing the larger number by the smaller number until getting a remainder of 0. It works by taking the remainder of each division as the new number to divide the previous divisor by. The last non-zero remainder is the GCD. The document provides examples finding the GCD of 24 and 60, and 40 and 64 using this method of repeated division and recording the remainders.

Uploaded by

tigersayooj
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 1

Euclidean Algorithm This algorithm finds GCD by performing repeated division starting from the two numbers we want

to find the GCD of until we get a remainder of 0. For our example, 24 and 60, below are the steps to find GCD using Euclid's algorithm. Divide the larger number by the small one. In this case we divide 60 by 24 to get a quotient of 2 and remainder of 12. Next we divide the smaller number (i.e. 24) by the remainder from the last division (i.e. 12). So 24 divide by 12, we get a quotient of 2 and remainder of 0. Since we already get a remainder of zero, the last number that we used to divide is the GCD, i.e 12. Let's look at another example, find GCD of 40 and 64. 64 40 = 1 with a remainder of 24 40 24 = 1 with a remainder of 16 24 16 = 1 with a remainder of 8 16 8 = 2 with a remainder of 0. We stop here since we've already got a remainder of 0. The last number we used to divide is 8 so the GCD of 40 and 64 is 8

If we know the greatest common divisor (GCD) of integers LCM using the following formula.

a and b, we can calculate the

LCM(a,b) =

ab GCD(a,b)

You might also like