Scilab Home page | Wiki | Bug tracker | Forge | Mailing list archives | ATOMS | File exchange
Please login or create an account
Change language to: Français - Português - 日本語 - Русский

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

# 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 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)`.

### Examples

```//polynomial case
s=poly(0,'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)```

### See Also

• gcd — Greatest Common Divisor
• bezout — Bezout equation for polynomials or integers

### Comments

Add a comment:
Please login to comment this page.

 Report an issue << gcd Discrete mathematics perms >>

 Scilab EnterprisesCopyright (c) 2011-2017 (Scilab Enterprises)Copyright (c) 1989-2012 (INRIA)Copyright (c) 1989-2007 (ENPC)with contributors Last updated:Fri Apr 11 14:06:50 CEST 2014