#15236: Let Sage use finite fields without primality proving
-------------------------+-------------------------------------------------
Reporter: jpflori | Owner:
Type: | Status: new
enhancement | Milestone: sage-6.0
Priority: major | Keywords: finite fields, primality
Component: finite | proving
rings | Authors:
Merged in: | Report Upstream: N/A
Reviewers: | Branch:
Work issues: | Dependencies:
Commit: |
Stopgaps: |
-------------------------+-------------------------------------------------
It would be nice to be able to create finite fields without checking that
the characteristic is actually prime.
You can more or less do that for prime fields using directly the
FiniteField_prime_modn constructor with check=False arguments.
Unfortunately some constructions on top of this will still check that the
characteristic is actually prime, e.g. univariate polynomial rings on top
of it.
--
Ticket URL: <http://trac.sagemath.org/ticket/15236>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
