mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Prime Gap Searches

Reply
 
Thread Tools
Old 2020-01-04, 01:33   #12
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

11110000012 Posts
Default

Quote:
Originally Posted by Thomas11 View Post
Here are the first occurrences of gaps between quadruplets searched up to 1e12.

Largest gap: 85025 342611795411

Smallest unknown gap: 21764

What are the next 7 unknown gaps? And how many of those are either 1 mod 7 or 6 mod 7?
rudy235 is offline   Reply With Quote
Old 2020-01-04, 13:35   #13
mart_r
 
mart_r's Avatar
 
Dec 2008
you know...around...

22×5×29 Posts
Default

Quote:
Originally Posted by rudy235 View Post
What are the next 7 unknown gaps? And how many of those are either 1 mod 7 or 6 mod 7?
Pencil, paper and some simple modular arithmetic suffice to show that there's a high probability that all of them are +/-1 mod 7.

Code:
gap/30 mod 7  number of open residues
2, 5          0 (as you already noticed)
1, 6          1
3, 4          2
0             3
mart_r is offline   Reply With Quote
Old 2020-01-04, 14:26   #14
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

23·5·47 Posts
Default

Quote:
Originally Posted by rudy235 View Post
What are the next 7 unknown gaps? And how many of those are either 1 mod 7 or 6 mod 7?
At 2e12 looks like the first is 25964 and the next is 26074

Has anyone got a perl or an exe file that can take the results from Thomas11's program and make a list of first instances?

I'll take this to 1e13

Last fiddled with by robert44444uk on 2020-01-04 at 14:26
robert44444uk is offline   Reply With Quote
Old 2020-01-05, 04:30   #15
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

312 Posts
Default

Quote:
Originally Posted by robert44444uk View Post
At 2e12 looks like the first is 25964 and the next is 26074

Has anyone got a perl or an exe file that can take the results from Thomas11's program and make a list of first instances?

I'll take this to 1e13
...and while we are asking for thigs, it would be useful to have the still unknown gaps.
Because this search is being done exhaustively they should not be any C?C, just gaps not yet discovered like:25964 and 26074
rudy235 is offline   Reply With Quote
Old 2020-01-05, 08:20   #16
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

23·5·47 Posts
Default

At 2e13 the earliest I could find without a value appears to be 42981

The largest was 129489 16837633318811

These results should be considered provisional until I get a program to handle the results.
robert44444uk is offline   Reply With Quote
Old 2020-01-06, 08:34   #17
Thomas11
 
Thomas11's Avatar
 
Feb 2003

77116 Posts
Default

Quote:
Originally Posted by robert44444uk View Post
Has anyone got a perl or an exe file that can take the results from Thomas11's program and make a list of first instances?
Here are two perl scripts for managing the gap results.

Both assume that your master gap list is stored in the file "gaplist.txt" (an example file with gaps up to 1e12 is included).

Usage is as follows:
Code:
perl update_gaplist.pl logfile.txt
This will add all new first instances to gaplist.txt

Code:
perl check_gaplist.pl
This is a quick check for any wrong gaps and reports the unknown gaps.

The screen output of the latter will look as the following:
Code:
21764 (1) -- unknown
22700 (6) -- unknown
22807 (1) -- unknown
23143 (1) -- unknown
24100 (6) -- unknown
The values in parentheses are "gap mod 7".
Attached Files
File Type: zip quadgaptools.zip (197.1 KB, 53 views)

Last fiddled with by Thomas11 on 2020-01-06 at 08:37
Thomas11 is offline   Reply With Quote
Old 2020-01-06, 09:55   #18
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

75816 Posts
Default

Quote:
Originally Posted by Thomas11 View Post
Here are two perl scripts for managing the gap results.

Both assume that your master gap list is stored in the file "gaplist.txt" (an example file with gaps up to 1e12 is included).

Usage is as follows:
Code:
perl update_gaplist.pl logfile.txt
This will add all new first instances to gaplist.txt

Code:
perl check_gaplist.pl
This is a quick check for any wrong gaps and reports the unknown gaps.

The screen output of the latter will look as the following:
Code:
21764 (1) -- unknown
22700 (6) -- unknown
22807 (1) -- unknown
23143 (1) -- unknown
24100 (6) -- unknown
The values in parentheses are "gap mod 7".
Good man, Thomas11!

I'll post the results when I get to 1e14 - at the moment I am at 3e13 with 52048 as the smallest unknown.

The largest gaps to 3e13 are:

111504 29595233745191
112105 26248083591881
113152 28184538475271
113467 25801593675041
114083 8547351574961
115224 15114108020021
118307 18317170605491
125692 18888105484811
129489 16837633318811
robert44444uk is offline   Reply With Quote
Old 2020-01-06, 19:52   #19
mart_r
 
mart_r's Avatar
 
Dec 2008
you know...around...

22×5×29 Posts
Default

Quote:
Originally Posted by rudy235 View Post
What are the next 7 unknown gaps? And how many of those are either 1 mod 7 or 6 mod 7?
The really interesting question would be "is the number of first holes that are not 1 or 6 mod 7 finite?"

You might have a look at similar data from prime gaps (check successive maximal values of p in increasing gaps g and how many are g mod 3 = 1 or 2) or twin prime gaps (how many g/6 mod 5 = 1 or 4). I'd guess the bias for quad prime gaps should be even stronger.
mart_r is offline   Reply With Quote
Old 2020-01-07, 04:45   #20
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

312 Posts
Default

Quote:
Originally Posted by mart_r View Post
The really interesting question would be "is the number of first holes that are not 1 or 6 mod 7 finite?"

You might have a look at similar data from prime gaps (check successive maximal values of p in increasing gaps g and how many are g mod 3 = 1 or 2) or twin prime gaps (how many g/6 mod 5 = 1 or 4). I'd guess the bias for quad prime gaps should be even stronger.
I believe that all gaps ≤ N (except the aforementioned with 2 or 5 mod7) are to be found if you search high enough. I don't quite understand what is meant by first holes.
rudy235 is offline   Reply With Quote
Old 2020-01-07, 17:09   #21
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

23·5·47 Posts
Default

Quote:
Originally Posted by robert44444uk View Post
Good man, Thomas11!

I'll post the results when I get to 1e14 - at the moment I am at 3e13 with 52048 as the smallest unknown.

The largest gaps to 3e13 are:

….
129489 16837633318811
Now at 9e13, and 52048 is still the smallest unknown. Large gaps were:

Code:
140945 30709975578251
143014 68802225596051
143374 73374129557621
148435 48935654916221
151264 43785651890171
153447 47998980412211
159414 74498625237131
162830 55341128536691

Last fiddled with by robert44444uk on 2020-01-07 at 17:09
robert44444uk is offline   Reply With Quote
Old 2020-01-07, 18:37   #22
mart_r
 
mart_r's Avatar
 
Dec 2008
you know...around...

22·5·29 Posts
Default

Quote:
Originally Posted by rudy235 View Post
I believe that all gaps ≤ N (except the aforementioned with 2 or 5 mod7) are to be found if you search high enough. I don't quite understand what is meant by first holes.
First holes, in this case, are the gaps for which you have to search farthest to find them.

For ordinary prime gaps, this is A100180
mart_r is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
GAPS BETWEEN PRIME PAIRS (Twin Primes) rudy235 Prime Gap Searches 218 2020-09-26 20:14
Gaps between maximal prime gaps Bobby Jacobs Prime Gap Searches 52 2020-08-22 15:20
Prime Quadruplet Emirps Trejack Puzzles 11 2016-04-22 19:27
Gaps of Primes? PawnProver44 Miscellaneous Math 10 2016-04-10 19:32
Top-5 prime quadruplet found gd_barnes Riesel Prime Search 10 2007-10-27 01:54

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

Tue Sep 29 03:50:47 UTC 2020 up 19 days, 1:01, 0 users, load averages: 1.38, 1.41, 1.51

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.