View Single Post
Old 2007-05-11, 22:28   #7
Citrix
 
Citrix's Avatar
 
Jun 2003

5·317 Posts
Default

Quote:
Originally Posted by jasong View Post
I know people think I'm an idiot for suggesting this, but I'm not saying we should work on it the same way Riesel Sieve and Seventeen or Bust are doing it.

Before I explain my idea, I'll explain the Brier problem, so everyone knows. Most people know that the Riesel and Sierpenski conjecture involves numbers where k*2^n+1 and K*2^n-1 have ks that will always yield a composite, no matter what you plug in as n. They're basically trying to find n's that yield each k below the number prime. Riesel Sieve is down to 68 k's and Seventeen or Bust is down to 7 k's. The Brier problem involves finding the lowest number that is both a Riesel number and a Sierpenski number. Okay, now that that's out of the way...

I suggest taking candidate k's and coming up with an automated way of plugging them into the NewPGen engine. Basically, it would be k*2^n+or-1, with about 1000 n and sieving up to a low p like 5000. This way we could get rid of numbers as quickly as possible. Any combination where all the ns disappeared would be tried a second time with 10,000 ns, then 100,000 ns. If 100,000 ns worked, then they would try +1 if the first try had been -1, or vice-versa.

There's probably a lot of other stuff we could add that would expedite things, but that's the basic idea.

What do you guys think?

It is possible to do this, but you will have to restrict your self to certain kind of k's. For example you can exclude all k's that are multiple of 3's since there probability to be a brier number is low. Basically instead of testing all the k's, you are only testing low weight sierpinski and riesel numbers together.

But if you wanted to test each and every k till 10^27, I don't think that will be feasible with current technology.
Citrix is offline   Reply With Quote