payam
By sieving fast code in gmp to find good payam numbers, where k*2^n+-1 is prime for at least 100 n values (1<=n<=10000).
Code in c: payam.c
sample txt files to use it: in.txt and progress.txt
downloadable programs: payamathlon.exe and payampentium.exe
*******************************************************************************
Faster code:
sample txt files to use it: in.txt and progress.txt