mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2020-08-02, 20:24   #12
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

240018 Posts
Default

Quote:
Originally Posted by rogue View Post
Question. If k*b^n+c is not evenly divisible by d, should those terms removed prior to sieving?

Yes.
gd_barnes is offline   Reply With Quote
Old 2020-08-04, 09:58   #13
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

3×5×383 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
Yes.
Maybe with a warning but yes. It may be deliberate it may be due to a mistake.
henryzz is offline   Reply With Quote
Old 2020-08-04, 12:09   #14
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

32×23×29 Posts
Default

Quote:
Originally Posted by henryzz View Post
Maybe with a warning but yes. It may be deliberate it may be due to a mistake.
Are you thinking that srsieve2 could output a message like "xxx terms for sequence k*b^n+c are not divisible by d and have been removed"?
rogue is offline   Reply With Quote
Old 2020-08-04, 13:52   #15
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

167116 Posts
Default

Quote:
Originally Posted by rogue View Post
Are you thinking that srsieve2 could output a message like "xxx terms for sequence k*b^n+c are not divisible by d and have been removed"?
Yes that could make sense.

Last fiddled with by henryzz on 2020-08-04 at 15:08
henryzz is offline   Reply With Quote
Old 2020-08-04, 19:36   #16
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

101000000000012 Posts
Default

Agreed
gd_barnes is offline   Reply With Quote
Old 2020-10-22, 07:52   #17
sweety439
 
sweety439's Avatar
 
Nov 2016

22×33×23 Posts
Default

Is srsieve2 updated? If so, can you use it to reserve the S3 problem in Sierpinski conjectures and proofs and the R43 problem in Riesel conjectures and proofs? (the latter is a 1k base and I have already used PARI to search it to 12K with no (probable) prime found)
sweety439 is online now   Reply With Quote
Old 2020-10-22, 12:14   #18
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

32·23·29 Posts
Default

I have not made the change. Too busy.
rogue is offline   Reply With Quote
Old 2020-11-01, 00:25   #19
sweety439
 
sweety439's Avatar
 
Nov 2016

22×33×23 Posts
Default

Quote:
Originally Posted by rogue View Post
I have not made the change. Too busy.
See the edit https://github.com/curtisbright/mepn...914128b3303960 in GitHub, you can just remove srsieve divisible by 2 check.
sweety439 is online now   Reply With Quote
Old 2020-11-01, 00:36   #20
sweety439
 
sweety439's Avatar
 
Nov 2016

22·33·23 Posts
Default

By the way, this removing is original used for solving the "minimal prime problem" for odd bases, in 2015, a mega-digit (probable) prime (106*23^800873-7)/11 (which is 9{E_800873} in base 23, and the largest minimal prime in base 23) was found to solve the "minimal prime problem" in base 23 (see PRP top link), if one allows probable primes in place of proven primes.

The "minimal prime problem" is solved only for bases 2~16, 18, 20, 22~24, 30, 42, bases <=30 are still reserving (see https://github.com/curtisbright/mepn...ee/master/data, like the CRUS reserving for unproven Sierpinski/Riesel problems) and currently at width 200K and above, but bases 31~50 (see https://github.com/RaymondDevillers/primes) are currently only at width 10K, you can also reserve them like the CRUS reserving.

Note: There are some minimal prime for base 31~50 with width > 10K found by CRUS:

Base 37: (families FY{a} and R8{a} can be removed)

590*37^22021-1 (= FY{a_22021})
1008*37^20895-1 (= R8{a_20895})

Base 45: (families O{0}1 and AO{0}1 can be removed, and hence families O{0}1F1, O{0}ZZ1, unless they have small (probable) prime)

24*45^18522+1 (= O{0_18521}1)
474*45^44791+1 (= AO{0_44790}1) [this prime is not minimal prime]

Base 49: (families 11c{0}1, Fd{0}1, SL{m} and Yd{m} can be removed, and hence families S6L{m}, YUUd{m}, YUd{m}, unless they have small (probable) prime)

2488*49^29737+1 (= 11c{0_29736}1)
774*49^18341+1 (= Fd{0_18340}1)
1394*49^52698-1 (= SL{m_52698})
1706*49^16337-1 (= Yd{m_16337})

Also, I have found a minimal prime with width > 10K in base 40:

(13998*40^12381+29)/13, which equals Qa{U_12380}X in base 40 (the only other unsolved family in base 40 (S{Q}d (86*40^n+37)/3) was tested by me to width 87437, no (probable) prime found

Last fiddled with by sweety439 on 2020-11-01 at 00:38
sweety439 is online now   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 03:54.

Thu Nov 26 03:54:15 UTC 2020 up 77 days, 1:05, 3 users, load averages: 1.32, 1.50, 1.43

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.