Comment #32 on issue 3809 by prasoon9...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
@asmeurer: Sorry, I misunderstood your question. And I have run the test on
the narcissus prime. It's been running for a couple of hours now but I am
only using a netbook so it is bound to be slower.
@smichr: Hmm. That looks like the reason for the faster results. Probably
test on PyPy with it?
I can only see two inefficiencies till now: The one I mentioned earlier and
the other one is using pow(b, 2, n) vs using b**2 % n; The first one isn't
promising at all. We should test the second one.
If all fails, I suppose we should switch to some combination of algorithms
as we talked about before.
--
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 sympy-issues+unsubscr...@googlegroups.com.
To post to this group, send email to sympy-issues@googlegroups.com.
Visit this group at http://groups.google.com/group/sympy-issues?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
