On Nov 16, 10:22 am, William Stein <wst...@gmail.com> wrote: > [...] > They mention that Mathematica does have a "proof = True" version of > PrimeQ called ProvablePrimeQ that one can optionally load. I just > tried it on a 200-digit number and it took 22 seconds as compared to 3 > seconds in PARI (hence Sage).
Thanks William, I stand corrected. My post algorithm was psuedo-skim- correct. =) -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
