Use the prime factorization method to find
The last one might be too big for your calculator to crunch!
Now, we're probably going past the pre-algebra level.
Can we use the Euclidean Algorithm to find LCM's like we did with GCF's?
Well, kind of.
Actually, one you have the GCF (no matter what method you used), you can pop the LCM using this: