#10836: primitive root is broken
-----------------------------------+----------------------------------------
Reporter: kcrisman | Owner: was
Type: defect | Status: needs_review
Priority: critical | Milestone: sage-4.7
Component: number theory | Keywords:
Author: Karl-Dieter Crisman | Upstream: Reported upstream.
Developers deny it's a bug.
Reviewer: | Merged:
Work_issues: |
-----------------------------------+----------------------------------------
Comment(by kcrisman):
If you can find a quicker way to write that, this is fine. I was hoping
to speed things up by checking certain cases first, such as primes.
Branching can be confusing, you are right.
More precisely, it's what Pari claims is user input error. I actually
explicitly didn't do this because we didn't want to slow down the checking
of primitive roots for legitimate input, which this would do for huge
numbers - that is the whole idea behind Pari's thinking.
At this point, I'd appreciate the input of someone who actually needs
primitive roots of huge numbers! The question is whether we want the
bottleneck with legitimate or non-legitimate input. If it really is that
long for a four-digit number, maybe we go with your idea; that's pretty
bad.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10836#comment:9>
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 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.
