#5535: [with patch, needs review] is_primitive is computes integer prime
factorization on every call
-------------------------+--------------------------------------------------
Reporter: rhinton | Owner: tbd
Type: enhancement | Status: new
Priority: major | Milestone:
Component: algebra | Keywords:
-------------------------+--------------------------------------------------
Comment(by cremona):
One more comment: NTL has efficient routines for modular exponentiation
modulo polynomials over GF(p) which could be used to find the order of X
modulo f(X) and hence test primitivity of f: see
http://www.shoup.net/ntl/doc/ZZ_pX.txt. This would entirely independent
of the improvement implemented in this patch, of course.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5535#comment:7>
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
-~----------~----~----~----~------~----~------~--~---
