#4965: [with patch, needs review] Z/nZ[x] via FLINT's zmod_poly
------------------------------+---------------------------------------------
Reporter: malb | Owner: somebody
Type: defect | Status: new
Priority: major | Milestone: sage-3.3
Component: basic arithmetic | Resolution:
Keywords: |
------------------------------+---------------------------------------------
Comment (by robertwb):
Looks like you have to go down to 2^30.
{{{
sage: P.<x> = PolynomialRing(GF(next_prime(2^31)))
sage: type(x)
<type
'sage.rings.polynomial.polynomial_modn_dense_ntl.Polynomial_dense_mod_p'>
sage: P.<x> = PolynomialRing(GF(next_prime(2^30)))
sage: type(x)
<type 'sage.rings.polynomial.polynomial_zmod_flint.Polynomial_zmod_flint'>
}}}
Personally, I think it's a bad idea to impose a 32-b it cutoff for 64-bit
platforms.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4965#comment:37>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
