mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Sierpinski/Riesel Base 5

Reply
 
Thread Tools
Old 2009-05-17, 19:53   #1
Rincewind
 
Rincewind's Avatar
 
Oct 2006

6716 Posts
Default decreasing the n-range in the sr5data.txt

Hi, at the moment we are sieving for

Code:
184 <= n <= 2000000
According to the stats-page

the lowest n for an active test is
for riesel: 289605
and for sierpinski: 328596.
So if we start sieving in a Range
Code:
250000 <= n <= 2000000
we could save some time finding factors. Is it possible to change the range? or is this a bad idea?
Rincewind is offline   Reply With Quote
Old 2009-05-20, 01:50   #2
masser
 
masser's Avatar
 
Jul 2003
wear a mask

110011110102 Posts
Default

Bad Idea. Those n<=289000 have only been tested once. We like to have matching residues for each k,n pair. In other words, we like to test each candidate twice (at least!) and have matching residues.

This topic has been discussed before; search this subforum for previous discussion of this issue.
masser is offline   Reply With Quote
Old 2009-05-20, 05:09   #3
Rincewind
 
Rincewind's Avatar
 
Oct 2006

103 Posts
Default

OK, thank you.
Rincewind is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Working on the 28,000,000-30,000,000 range tha Lone Mersenne Hunters 183 2014-02-15 23:41
OK, how can we get a range now? thechickenman Lone Mersenne Hunters 4 2008-12-01 10:45
reserving range 54M - 55M to 2^63 Corbyguy Lone Mersenne Hunters 0 2007-09-07 14:55
Available range for TF to 2^60? edorajh Lone Mersenne Hunters 2 2003-12-31 16:04
getting a range? tom11784 Lone Mersenne Hunters 1 2003-08-29 18:56

All times are UTC. The time now is 09:16.


Sat Jul 17 09:16:27 UTC 2021 up 50 days, 7:03, 1 user, load averages: 1.97, 1.76, 1.65

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.