#6567: function to test whether or not some integer is a primitive root modulo n
-----------------------------------+----------------------------------------
Reporter: mvngu | Owner: was
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-5.8
Component: number theory | Resolution:
Keywords: primitive roots | Work issues:
Report Upstream: N/A | Reviewers: Julian Rueth, Simon Spicer
Authors: David Roe | Merged in:
Dependencies: #12116 | Stopgaps:
-----------------------------------+----------------------------------------
Description changed by roed:
Old description:
> 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.
New description:
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.
'''Apply''' [attachment:6567_2.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6567#comment:10>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
