On 2015-01-06 18:40, Peter Bruin wrote:
Hi Jeroen,
PARI now (as of somewhere in the 2.8 development branch) has a
nfsplitting() function to find the splitting field of a polynomial over
QQ (i.e. the Galois closure of an absolute number field). It does not
yet exist for relative number fields, as far as I can see.
Nice, and of course it's orders of magnitude faster than my semi-naive
Sage implementation :-)
What exactly do you mean by "factoring as a generator function"?
A function which "yields" factors of a given number one by one.
For example n.factor()[0] would return just one factor without computing
all factors.
--
You received this message because you are subscribed to the Google Groups
"sage-nt" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send an email to [email protected].
Visit this group at http://groups.google.com/group/sage-nt.
For more options, visit https://groups.google.com/d/optout.
