# How to use Euclids algorithim to find LCM?

by 0-RWHP
Tags: algorithim, euclids
 Share this thread:
 P: 2 I know it's a really basic problem. I can find GCD with it but I can't find how to use the euclidean algorithm to find the LCM of two numbers? Sorry for the noob question :)
 HW Helper P: 2,954 Once you have the GCD, use the well known equation LCM(a,b)*GCD(a,b) = a*b or LCM = (a*b)/GCD Just divide the product by the GCD and you have the LCM.
 P: 2 Oh ok, so with 8, 19 for example you would just do 8x19 then divide that by GCD of 8, 19. The GCD of 8, 19 is 1 so the answer is just 152 right? This is great, I loved when I discovered Euclids algorithm for GCD and was really excited when I found it could do LCM as well. Thanks so much for your help, I appreciate it.
HW Helper
P: 2,954
How to use Euclids algorithim to find LCM?

 Quote by 0-RWHP Oh ok, so with 8, 19 for example you would just do 8x19 then divide that by GCD of 8, 19. The GCD of 8, 19 is 1 so the answer is just 152 right? This is great, I loved when I discovered Euclids algorithm for GCD and was really excited when I found it could do LCM as well. Thanks so much for your help, I appreciate it.
No worries.

 Related Discussions Calculus & Beyond Homework 2 Calculus 0 Calculus & Beyond Homework 3 Set Theory, Logic, Probability, Statistics 1 Electrical Engineering 0