use Boinc
 

how can i use Boinc to submit my project to find primes of the form (2^k-1)*10^d+2^(k-1)-1 where d is the number of decimal digits of 2^(k-1)-1?

How far have you searched? How deeply have you sieved?
Why is BOINC the right choice, rather than doing the search yourself? Do you have the IT skills to maintain a BOINC server, sieve candidates correctly to feed the server, and market the project as something more than "I like this format, please look for them for me"?

reply
 

[QUOTE=VBCurtis;518161]How far have you searched? How deeply have you sieved?
Why is BOINC the right choice, rather than doing the search yourself? Do you have the IT skills to maintain a BOINC server, sieve candidates correctly to feed the server, and market the project as something more than "I like this format, please look for them for me"?[/QUOTE]

i dont know who you are...Curtis...it doesnt sound like Newton or Leibniz