Use the following theorem,Originally Posted by kodirl
Procede with Euclidean Algorithm,
Therefore,
Therefore,
Hello, Kerry!
Do you know the Euclidean Algorithm?
If you do, exactly where is your difficulty?
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