#6567: function to test whether or not some integer is a primitive root modulo n
---------------------------+------------------------------------------------
Reporter: mvngu | Owner: was
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.1.1
Component: number theory | Keywords: primitive roots
Reviewer: | Author:
Merged: |
---------------------------+------------------------------------------------
Currently, the function {{{primitive_root()}}} finds a primitive root
modulo n. Ticket #6467 proposes to find all primitive roots modulo a fixed
n. We should also implement a function to determine whether or not some
integer is a primitive root modulo n. A good way is to do this without
first having to generate all primitive roots mod n.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6567>
Sage <http://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 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
-~----------~----~----~----~------~----~------~--~---
