Can someone please show me how to find the lcm useing prime factorization ? i am so confused about this here is a sample problem 18 and 24
Hello,Originally Posted by Sandra14
it's me again.
I've attached a diagram to show you how you can find the lcm for 2 and more numbers by using prime factorization.
Maybe you need some time to understand the "mechanic" which is used. But if you've understand it, it's a very easy way to do a very unpleasent calculation.
The easiest method I know if it done through the Euclidean Algorithm. You basically work with the greatest common divisor. There is a theorem that:Originally Posted by Sandra14
If you understand what I said, good. If you like me to explain how to use this to find both the greatest common divisor and lowest common multiple please ask.