C++ algorithm to calculate least common multiple for multiple numbers

Question

Is there a C++ algorithm to calculate the least common multiple for multiple numbers, like lcm(3,6,12) or lcm(5,7,9,12)?

Answer 1

• let the set of numbers whose lcm you wish to calculate be theta
• let i, the multiplier, be = 1
• let x = the largest number in theta
• x * i
• if for every element j in theta, (x*i)%j=0 then x*i is the least LCM
• if not, loop, and increment i by 1