mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > jasong

Reply
 
Thread Tools
Old 2007-07-23, 05:31   #1
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

DB316 Posts
Default Fun with the SOB and Riesel Sieve problem

I was thinking about the Riesel Sieve problem and how we're only considering odd ks. At the point we're at in the search, for any n we can find to make a k prime, it's trivial to extend that to any multiples of k that are still less than the Riesel number 509203.

Here's the thing, there are probably odd ks where the first n-value that yields a prime is so low that it doesn't cover the multiples. What I propose is that someone make a script that goes through the odd k up to 127,300, figures out how many times it would have to be multiplied by 2 to get a number bigger than 509203, and makes sure the n-value is at least that big. If it's smaller, then that number gets flagged.

I know someone probably figured this out a long time ago, and maybe came up with a reason to dismiss the problem. But it's something to consider, the possibility that there may be a k that needs a prime and nobody has paid any attention because we're only worried about odd k.

It would be fairly simple to test each number to n=19, to generate a file to run a script against; probably less trouble if we simply let the computer do a bit of unnecessary work in finding low primes.

Would anybody be interested in trying this? I don't have the skills to make a script, or I'd do it myself.

Oh, and it also extends to the Seventeen or Bust problem, which is the reason I included that in my subject line. :)
jasong is offline   Reply With Quote
Old 2007-07-23, 06:29   #2
axn
 
axn's Avatar
 
Jun 2003

3·11·157 Posts
Default

Quote:
Originally Posted by jasong View Post
and maybe came up with a reason to dismiss the problem
See Sierpinski Problem and Riesel Number definitions. They are, by definition, limited to odd k's. A given (odd) k represents a whole series of integers (k.2^n+/-1, n>=1). If at least one prime is exhibited for the series, that's it, the k is not a Sierpinski/Riesel number. Multiples of k (by powers of 2) do NOT constitute a different series.

Last fiddled with by axn on 2007-07-23 at 06:30
axn is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
The dual Sierpinski/Riesel problem sweety439 sweety439 14 2021-02-15 15:58
The reverse Sierpinski/Riesel problem sweety439 sweety439 20 2020-07-03 17:22
Dual Riesel problem jasong Math 11 2020-06-03 17:12
A multiple k/c sieve for Sierpinski/Riesel problems geoff Sierpinski/Riesel Base 5 522 2009-10-28 05:46
Prime in Riesel Sieve Project Sloth Prime Sierpinski Project 1 2006-05-10 02:02

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


Wed Dec 1 09:53:47 UTC 2021 up 131 days, 4:22, 1 user, load averages: 1.00, 1.10, 1.12

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.