Top
Back: zeroset_lib
Forward: Factor
FastBack: ntsolve_lib
FastForward: rootsmr_lib
Up: zeroset_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.7.5.1 EGCD

Procedure from library zeroset.lib (see zeroset_lib).

Usage:
EGCD(f, g); where f,g are polynomials

Purpose:
compute the polynomial gcd of f and g over Q(a)[x]

Return:
polynomial h s.t. h is a greatest common divisor of f and g (not nec. monic)

Assume:
basering = Q(a)[t]

Example:
 
LIB "zeroset.lib";
ring R = (0,a), x, lp;
minpoly = a2+1;
poly f =  x4 - 1;
poly g = x2 - 2*a*x - 1;
EGCD(f, g);
==> (-4a)*x-4


Top Back: zeroset_lib Forward: Factor FastBack: ntsolve_lib FastForward: rootsmr_lib Up: zeroset_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-0-1, October 2005, generated by texi2html.