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?
There is the is_pseudo_prime method that uses PARI's Baillie-PSW probabilistic primality test:
sage: z = 2^100000-1
sage: z.is_pseudoprime()
FalsePARI is written in C.
Asked: 6 years ago
Seen: 634 times
Last updated: Jan 24 '19
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.