Use the euclidean algorithm to find the gcd of 2232 and 3828 and find the lcm of 2232 and 3828.

I'm not expecting an answer maybe just a quick and easy example of how to solve the sum quickly..thanks

Printable View

- Aug 10th 2006, 04:50 AMkodirlEuclidean algorithm gcd lcm help..
Use the euclidean algorithm to find the gcd of 2232 and 3828 and find the lcm of 2232 and 3828.

I'm not expecting an answer maybe just a quick and easy example of how to solve the sum quickly..thanks - Aug 10th 2006, 05:21 AMThePerfectHackerQuote:

Originally Posted by**kodirl**

Procede with Euclidean Algorithm,

Therefore,

Therefore,

- Aug 10th 2006, 05:46 AMSoroban
Hello, Kerry!

Do you*know*the Euclidean Algorithm?

If you do, exactly*where*is your difficulty?

Quote:

Use the Euclidean Algorithm to find the GCD and LCM of 2232 and 3828.

__Example__: Find the GCD of 72 and 120.

Step 1: Divide the larger by the smaller.

. . . . . .

Step 2: Divide the*divisor*by the*remainder.*

. . . . . .

Repeat Step 2 until a zero remainder is achieved.

. . . . . .

. . . . . . . . . .

. . The*last divisor*is the GCD.

Therefore: .**24**

There is a formula for the LCM: .

Hence: .**360**