#16878: faster is_prime
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: number theory | Resolution:
Keywords: | Merged in:
Authors: Vincent Delecroix | Reviewers: Jeroen Demeyer
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/16878 | d7dc38918903a97af742a90050ce87c58f6f222a
Dependencies: #15767 | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jdemeyer):
* status: needs_review => needs_work
Comment:
{{{10000000000000000 != 2^64}}} :-)
I don't think we should lower `PARI_PSEUDOPRIME_LIMIT` because it's also
used in places where it's not bounded by `ULONG_MAX`, see `next_prime()`
for example.
Personally, I would assume that `ULONG_MAX` < `2^64` and just use
`mpz_fits_uint_p()`.
--
Ticket URL: <http://trac.sagemath.org/ticket/16878#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 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/d/optout.
