Go to the first, previous, next, last section, table of contents.
- asq(poly)
-
:: Square-free factorization of polynomial poly over an
algebraic number field.
- af(poly,alglist)
-
:: Factorization of polynomial poly over an
algebraic number field.
- return
-
list
- poly
-
polynomial
- alglist
-
root
list
-
Both defined in the file `sp'.
-
If the inputs contain no root's, these functions run fast
since they invoke functions over the integers.
In contrast to this, if the inputs contain root's, they sometimes
take a long time, since
cr_gcda()
is invoked.
-
Function
af()
requires the specification of base field,
i.e., list of root's for its second argument.
-
In the second argument
alglist
, root defined last must come
first.
-
The result is a list, as a result of usual factorization, whose elements
is of the form [factor, multiplicity].
-
The product of all factors with multiplicities counted may differ from
the input polynomial by a constant.
[99] asq(-x^4+6*x^3+(2*alg(0)-9)*x^2+(-6*alg(0))*x-2);
[[-x^2+3*x+(#0),2]]
[100] af(-x^2+3*x+alg(0),[alg(0)]);
[[x+(#0-1),1],[-x+(#0+2),1]]
- Reference
-
section
cr_gcda
, section fctr
, sqfr
Go to the first, previous, next, last section, table of contents.