#6567: function to test whether or not some integer is a primitive root modulo n
-----------------------------------+----------------------------------------
Reporter: mvngu | Owner: was
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.8
Component: number theory | Resolution:
Keywords: primitive roots | Work issues:
Report Upstream: N/A | Reviewers: Julian Rueth
Authors: David Roe | Merged in:
Dependencies: #12116 | Stopgaps:
-----------------------------------+----------------------------------------
Comment (by kcrisman):
{{{
# self**(p**k*(p-1)//q) = 1 for some q
}}}
Should that be `k-1`? I'd also put it "# now self..." just to make it
clear
Everything else looks nice. I feel like I want to check the logic for
numbers divisible by 2, 3, or 5 but where start > 5 a little more closely
(getting late here) but if someone else does that first that is fine.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6567#comment:5>
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.
