Comment #30 on issue 3809 by [email protected]: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
On the basis of comment #13 I think this issue should be closed as invalid.
A 3200 digit number takes 65 seconds to square mod n. There is no way the
isprime test is going to return any faster on the much longer narcissus
prime unless one only tests a single prime.
Nonetheless, some changes to make things a little more efficient are in a
new PR.
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" 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/sympy-issues?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
