Computes the least common multiple of the input values.
Least common multiple of x and y.
LCM(x,y) is the smallest integer m for which there exist integers c and d such that
To compute LCM(x,y), consider the prime factorizations of x and y:
where pi are all the prime factors of x and y. If pi does not occur in a factorization, the corresponding exponent is 0. LCM(x,y) then is given by:
The prime factorizations of 12 and 30 are given by:
Where This Node Can Run:
Desktop OS: Windows
FPGA: Not supported
Web Server: Not supported in VIs that run in a web application