Go to the first, previous, next, last section, table of contents.
 cr_gcda(poly1,poly2,alist)

:: GCD of two univariate polynomials over an algebraic number field.
 return

polynomial
 poly1, poly2

polynomial
 alist

list

Defined in the file `sp'.

Finds the GCD of two univariate polynomials.

alist is a list of root's.
All the root's appearing in the input and those required to define
the root's in the list must appear in the list. In the list
,if the defining polynomial of a contains b
then a must come first.
[76] X=x^6+3*x^5+6*x^4+x^33*x^2+12*x+16$
[77] Y=x^6+6*x^5+24*x^4+8*x^348*x^2+384*x+1024$
[78] A=newalg(X);
(#0)
[79] cr_gcda(X,subst(Y,x,x+A),[A]);
x+(#0)
 Reference

section
gr
, hgr
, gr_mod
, dgr
, section asq
, af
Go to the first, previous, next, last section, table of contents.