View Single Post
Old 2017-09-27, 01:28   #1
Citrix
 
Citrix's Avatar
 
Jun 2003

1,579 Posts
Default Super Cullen & Woodall primes

Super Cullen and Woodall defined as:-

C(n)= n*2^(n*n)+1
W(n)= n*2^(n*n)-1

Primes so far
1*2^1-1
1*2^1+1
2*2^4-1
5*2^25+1
9*2^81+1

I think there are finite number of these primes, but I still wanted to search further.
I have checked these up to 5 Million bits and plan to search further.

I am using srsieve to sieve these numbers. Is there a faster sieve software or can gcwsieve be made faster for these numbers?
Citrix is offline   Reply With Quote