Quote:
Originally Posted by MiniGeek
I've started testing for twins (PRP or provable) of all primes on the top 5000 list that do not have a base of 2 (since I can test those by downloading Karsten's lists). The timestamp for the list was "Thu Jan 20 04:51:06 CST 2011". I made a Python script to parse it out, which I'll post when I have results to post. Due to the vastly varying bases, GFNs, Phi's, and factorials/primorials, I don't see how I can really presieve this efficiently, so I'm just running it in PFGW with f.

Results and Python 3.x parsing script attached. I also searched for twins of Proth primes (k*2^n+1) with a k over 10000 since those aren't on Karsten's list yet, and presieved that with srsieve. No primes found. Not counting numbers divisible by 3, I factored or tested 566 numbers. The other ones were of the type that they should be included on one of Karsten's lists.