mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2017-05-02, 00:34   #56
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default status report

k=2 and k=4 @ base=3 tested till n=1.61M
127*128^n-1 tested till n=1.6M
Cruelty is offline   Reply With Quote
Old 2017-05-02, 02:16   #57
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

23·191 Posts
Default

I am almost to 6M on 127*2^n-1. Might you prepare a 6M-7M file for me with the tests you've run removed? If that's inconvenient, I'll settle for a results file of your tests from 6M to 7M.
VBCurtis is offline   Reply With Quote
Old 2017-05-02, 05:24   #58
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

23·7·163 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
I am almost to 6M on 127*2^n-1. Might you prepare a 6M-7M file for me with the tests you've run removed? If that's inconvenient, I'll settle for a results file of your tests from 6M to 7M.
Even before reaching 6M, by knowing that Borys already searched for these 127*2^(7*n)-1 (reaching at least 7*n <= 11,200,000), you could simply remove all n :: 7|n from your candidate list.
Batalov is offline   Reply With Quote
Old 2017-07-02, 23:05   #59
Cruelty
 
Cruelty's Avatar
 
May 2005

2·809 Posts
Default status report

k=2 and k=4 @ base=3 tested till n=1.63M
127*128^n-1 tested till n=1.66M
Cruelty is offline   Reply With Quote
Old 2017-10-27, 08:40   #60
Cruelty
 
Cruelty's Avatar
 
May 2005

2·809 Posts
Default status report

k=2 and k=4 @ base=3 tested till n=1.66M
127*128^n-1 tested till n=1.71M (sieving)
Cruelty is offline   Reply With Quote
Old 2017-12-02, 15:31   #61
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default status report

k=2 and k=4 @ base=3 tested till n=1.67M
127*128^n-1 tested till n=1.72M
Cruelty is offline   Reply With Quote
Old 2018-01-01, 14:19   #62
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default status report

k=2 and k=4 @ base=3 tested till n=1.68M
127*128^n-1 tested till n=1.73M
Cruelty is offline   Reply With Quote
Old 2018-01-01, 19:54   #63
sweety439
 
sweety439's Avatar
 
Nov 2016

17·139 Posts
Default

Please see the project http://mersenneforum.org/showthread.php?t=21818&page=6 for the primes of the form (b+-1)*b^n+-1 and (probable) primes of the form b^n+-(b+-1). (b^n+-(b+-1) is the dual of (b+-1)*b^n+-1) I have searched these forms for all bases 2<=b<=1024.

Last fiddled with by sweety439 on 2018-01-01 at 19:55
sweety439 is offline   Reply With Quote
Old 2018-02-02, 17:18   #64
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default status report

k=2 and k=4 @ base=3 tested till n=1.69M
127*128^n-1 tested till n=1.74M
Cruelty is offline   Reply With Quote
Old 2018-04-12, 21:28   #65
sweety439
 
sweety439's Avatar
 
Nov 2016

236310 Posts
Default

Quote:
Originally Posted by Cruelty View Post
k=2 and k=4 @ base=3 tested till n=1.69M
127*128^n-1 tested till n=1.74M
You can update the primes of the form (b+-1)*b^n+-1 and the test limits in the page http://www.mersennewiki.org/index.php/Williams_prime.
sweety439 is offline   Reply With Quote
Old 2018-04-15, 03:39   #66
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

23×191 Posts
Default

Quote:
Originally Posted by Batalov View Post
Even before reaching 6M, by knowing that Borys already searched for these 127*2^(7*n)-1 (reaching at least 7*n <= 11,200,000), you could simply remove all n :: 7|n from your candidate list.
I'm ready to search 7-8M, and may as well learn how to remove such candidates myself. How would I go about removing such n in a non-manual fashion?
VBCurtis is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 13:40.

Mon Oct 26 13:40:20 UTC 2020 up 46 days, 10:51, 0 users, load averages: 1.50, 1.77, 1.78

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.