CoCoA:GCD

GCD

greatest common divisor

Description

This function returns the greatest common divisor of F_1,...,F_n

or of the elements in the list L.

For the calculation of the GCDs and LCMs of polynomials, the coefficient ring must be a field.

Example

  Use R ::= Q[x,y];
  F := x^2-y^2;
  G := (x+y)^3;
  GCD(F,G);
x + y
-------------------------------
  GCD(3*4,3*8,6*16);
12
-------------------------------
  GCD([3*4,3*8,6*16]);
12
-------------------------------

Syntax

GCD(F_1:INT,...,F_n:INT):INT
GCD(L:LIST of INT):INT

GCD(F_1:POLY,...,F_n:POLY):POLY
GCD (L:LIST of POLY):POLY

Div

Mod

LCM

   <type>groebner</type>
   <type>groebner-basic</type>
   <type>integer</type>
   <type>polynomial</type>