Enter two or more positive integers to get their least common multiple. Results include prime factorizations and a short step-by-step breakdown.
We use the identity LCM(a, b) = |a × b| / GCD(a, b) and extend it to multiple numbers by taking LCM of the first two, then LCM of that result with the next number, and so on. Prime factorizations are shown so you see where the result comes from.
Common denominators for fractions, syncing repeating events (e.g. when three loops align), and pattern or cycle length in sequences. For fraction work, the GCD calculator pairs well with this tool.
