Primality Testing
These numbers are proven to be prime for the values of q up to 42737. Those with q > 42737 are probable primes as of February 2010. The primality proof for q = 42737 was performed by François Morain in 2007 with a distributed ECPP implementation running on several networks of workstations for 743 GHz-days on an Opteron processor. It is the fourth largest primality proof by ECPP as of 2010.
Currently, the fastest known algorithm for proving the primality of Wagstaff numbers is ECPP.
Read more about this topic: Wagstaff Prime
Famous quotes containing the word testing:
“No testing has overtaken you that is not common to everyone. God is faithful, and he will not let you be tested beyond your strength, but with the testing he will also provide the way out so that you may be able to endure it.”
—Bible: New Testament, 1 Corinthians 10:13.