Quote:
Originally Posted by Citrix
Thank you for pointing out mtsieve. (I did not know about this before :( )
There is something called modular exponentiation which will calculate k%p very fast.
Calculating k%p will take very little time per prime.
Addendum: Looks like srsieve is not implemented yet. So this will not help.

There will be a fair bit of manual work although it should be doable in a day or 2.