Scilab Website | Contribute with GitLab | Mailing list archives | ATOMS toolboxes
Scilab Online Help
5.5.2 - English

Change language to:
Français - 日本語 - Português - Русский

Please note that the recommended version of Scilab is 2025.0.0. This page might be outdated.
See the recommended documentation of this function

Scilab Help >> Elementary Functions > Discrete mathematics > lcm

lcm

least common multiple

Calling Sequence

[pp, fact] = lcm(p)

Arguments

p

a polynomial row vector p = [p1, ..., pn] (type equal to 2) or an integer row vector (type equal to 1 or 8).

fact

a polynomial vector or an integer vector.

pp

a polynomial or an integer.

Description

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.

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)

See Also

  • gcd — Greatest Common Divisor
  • bezout — Bezout equation for polynomials or integers
Report an issue
<< gcd Discrete mathematics perms >>

Copyright (c) 2022-2024 (Dassault Systèmes)
Copyright (c) 2017-2022 (ESI Group)
Copyright (c) 2011-2017 (Scilab Enterprises)
Copyright (c) 1989-2012 (INRIA)
Copyright (c) 1989-2007 (ENPC)
with contributors
Last updated:
Wed Apr 01 10:13:52 CEST 2015