Examples
// Polynomial case s = %s; p = [s s*(s+1)^2 s^2*(s+2)]; [pp,fact] = lcm(p); p.*fact, pp // Integer case V = int32([2^2*3^5, 2^3*3^2,2^2*3^4*5]); lcm(V) // Double case V = [2^2*3^5, 2^3*3^2,2^2*3^4*5]; lcm(V) |  |  |
least common multiple
[pp, fact] = lcm(p)
a polynomial row vector p = [p1, ..., pn] (type equal to 2) or
an integer row vector (type equal to 1 or 8).
a polynomial vector or an integer vector.
a polynomial or an integer.
pp = lcm(p) computes the lcm pp of polynomial vector p.
[pp, fact] = lcm(p) computes in addition the vector fact such that:
p.*fact = pp*ones(p).
The least common multiple of an array p of real numbers can be obtained by
converting it to a polynomial before calling lcm, through p = inv_coeff(p, 0).
If p is given as an integer double (type 1), then it is treated as an int32.
// Polynomial case s = %s; p = [s s*(s+1)^2 s^2*(s+2)]; [pp,fact] = lcm(p); p.*fact, pp // Integer case V = int32([2^2*3^5, 2^3*3^2,2^2*3^4*5]); lcm(V) // Double case V = [2^2*3^5, 2^3*3^2,2^2*3^4*5]; lcm(V) | | |