#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 dsm):
Well, it hasn't stopped after half an hour..
I don't quite follow you about the speed, though. Before every "return
ans" for n > 5 you either (1) test primality, (2) test for a prime power,
or (3) once again test for a prime power, so ISTM you're not avoiding the
cost of doing the tests on legitimate input, you're just doing it after
the znprimroot call instead of before. (And we get very similar times for
large legitimate input, which is what I'd expect if I'm right.)
If we really want a super-fast way to do this when needed -- and like you
I suspect, I have zero need for primitive roots of huge numbers so I have
no idea if this matters at all in practice `:^)` -- I say we add a
proof=False option, or whatever the standard is in other functions that
don't test their input for speed reasons (I think I've seen exactly this
situation before but can't think where right now).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10836#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 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.
