
#1
Dec2611, 06:00 PM

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 :)




#2
Dec2611, 07:07 PM

HW Helper
P: 2,885

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. 



#3
Dec2611, 07:56 PM

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.



Register to reply 
Related Discussions  
Find the upper and lower boundary curve to find the area between two curves.  Calculus & Beyond Homework  2  
Shell method to find volumes: need to find intersections of the curves involved?  Calculus  0  
Find Find the point in this plane where it intersects the z axis  Calculus & Beyond Homework  3  
Proving an algorithim  Set Theory, Logic, Probability, Statistics  1  
algorithim for charging SLA batteries  Electrical Engineering  0 