#15443: Random time outs in ecm.py
-------------------------------------+-------------------------------------
Reporter: vbraun | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.1
Component: number theory | Resolution:
Keywords: | Merged in:
Authors: Volker Braun | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vbraun/ecm_cleanup | 998126dbd22d30eb34b46a0f122f9d62a9f861c9
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nbruin):
Replying to [comment:26 vbraun]:
> So for a poor physicist like me, how exactly should we go about testing
(probabilistically, but with very low probability of failure comparable to
the probability in ECM) that a number is not composite. Is that already
implemented somewhere in Sage? Rabin-Miller with some particular list of
witnesses?
I'd expect it to be available somewhere, yes, at the very least in
PARI/GP. Baillie-PSW seems to be particularly bullet-proof (in the physics
sense), with no known pseudo-primes. Finding a counterexample could raise
some money for the sage foundation.
--
Ticket URL: <http://trac.sagemath.org/ticket/15443#comment:27>
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.
For more options, visit https://groups.google.com/groups/opt_out.