View Single Post
Old 2007-05-09, 16:02   #2
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

34B16 Posts
Default

It is an interesting idea but first try make a list of the k's you want to test.
Several other projects did also check these kind of numbers.

I think you have go to for a distributed approach like BOINC Primegrid / RieselSieve.

First sieve a whole lot of numbers to 1000T+ and then start crunching away.

For the moment, I am doing your 9*2^n-1 from 0 to 33M+ &
3^16 till 4M.

I do not know that it is still necessary to search / sieve candidates for 9*2^n-1.

Regards
Cedric

Last fiddled with by ValerieVonck on 2007-05-09 at 16:02
ValerieVonck is offline   Reply With Quote