View Single Post
Old 2021-08-24, 15:56   #41
ATH's Avatar
Dec 2003

1100111100002 Posts

Originally Posted by CraigLo View Post
The easiest way for me to fix this issue would be to use 12 SPRP tests which is sufficient to prove primality. Half the remaining numbers are prime after sieving so the code would take about 6-7 times longer to run.
It would be faster with 1 SPRP + 1 Lucas than 12 SPRP. At least the CPU code with the GMP library 1 Lucas test is about equal to 6.4-6.6 SPRP tests at 264 + 2*1016.
Why does 12 SPRP tests prove primality?
ATH is online now   Reply With Quote