use Boinc

enzocreti · 2019-05-30, 19:18

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?

VBCurtis · 2019-05-30, 19:50

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"?

enzocreti · 2019-05-31, 18:07

Quote:

Originally Posted by VBCurtis

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"?

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

2019-05-30, 19:18	#1
enzocreti Mar 2018 2·5·53 Posts	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?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
BOINC?	aurashift	PrimeNet	1	2018-08-27 23:19
BOINC.BE	BATKrikke	Teams	2	2010-03-05 18:57
BOINC?	masser	Sierpinski/Riesel Base 5	1	2009-02-09 01:10
BOINC?	KEP	Twin Prime Search	212	2007-04-25 10:29
BOINC	bebarce	Software	3	2005-12-15 18:35

2019-05-30, 19:50	#2
VBCurtis "Curtis" Feb 2005 Riverside, CA 4861₁₀ Posts	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"?