Scilab Website | Contribute with GitLab | Mailing list archives | ATOMS toolboxes
Scilab Online Help
5.3.3 - 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 >> Polynomials > gcd

gcd

gcd calculation

Calling Sequence

[pgcd,U]=gcd(p)

Arguments

p

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

Description

computes the gcd of components of p and a unimodular matrix (with polynomial inverse) U, with minimal degree such that

p*U=[0 ... 0 pgcd]

Examples

//polynomial case
s=poly(0,'s');
p=[s,s*(s+1)^2,2*s^2+s^3];
[pgcd,u]=gcd(p);
p*u

//integer case
V=int32([2^2*3^5, 2^3*3^2,2^2*3^4*5]);
[thegcd,U]=gcd(V)
V*U

See Also

  • bezout — Bezout equation for polynomials or integers
  • lcm — least common multiple
  • hermit — Hermite form
<< factors Polynomials hermit >>

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 Oct 05 12:09:56 CEST 2011