I have to test extremely huge numbers (100k+ digits) in a reasonable time. Are there codes for doing that? Are there C-codes interfaced with SAGE? Or something else?
Revision history [back]
 | 1 | initial version |
EFFICIENTLY TESTING PROBABLES PRIMES
EFFICIENTLY TESTING PROBABLES PRIMES
I have to test extremely huge numbers (100k+ digits) in a reasonable time. time if they are probable primes. Are there codes for doing that? Are there C-codes interfaced with SAGE? Or something else?
EFFICIENTLY TESTING PROBABLES PRIMES
I have to test extremely huge numbers (100k+ digits) in a reasonable time if they are probable primes. Are there codes for doing that? Are there C-codes interfaced with SAGE? Or something else?
