View Single Post
Old 2005-10-29, 09:28   #4
Thomas11
 
Thomas11's Avatar
 
Feb 2003

22×32×53 Posts
Default

I would vote for Riesel Search too.
Though, it sounds a bit like Riesel Sieve, which could lead to some confusion...

Nevertheless, it would be a good description of the general aim of this project, namely the Search for Riesel primes, k*2^n-1. The several sub-projects could then be called:
(1) low weight Riesel Search
(2) small k Riesel Search
and, perhaps:
(3) 15k Riesel Search

A don't think that there is a need for different prover codes for each of the sub-projects, as long as they are covered by the overall project title (and aim).

-- Thomas
Thomas11 is offline   Reply With Quote