Please note that the recommended version of Scilab is 6.1.1. This page might be outdated.

See the recommended documentation of this function

# gcd

Greatest Common Divisor

### Calling Sequence

[pgcd, U] = gcd(p)

### Arguments

- p
a polynomial row vector

`p = [p1, ..., pn]`

(type equal to 2) or an integer row vector (type equal to 8).

### Description

`[pgcd, U] = gcd(p)`

computes the gcd of components of `p`

(`pgcd`

) and a
unimodular matrix (with polynomial inverse) `U`

, with minimal degree such that

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

.

In mathematics, a *unimodular* matrix
`U`

is a square integer matrix having
determinant `+1`

or `-1`

.

The greatest common divisor of an array `p`

of real numbersof real numbers can be obtained by
converting it to a polynomial before calling `gcd`

, through `p = inv_coeff(p, 0)`

.

## Comments

Add a comment:Please login to comment this page.