3 Mar
2019
3 Mar
'19
11:16 a.m.
Hi Everyone, I am looking for a primality-proving program (presumably, based on ECPP) that runs on Windows, and which will work with numbers up to several thousand digits. For numbers that are not too large, Mathematica has the ability to produce primality certificates. I think it uses (recursively) partial factorizations of n + 1 and n - 1. However, on Linux, the primo program http://www.ellipsa.eu/public/primo/primo.html can prove primality of much larger numbers. Thanks for any info you might have! Bob Baillie