mersenneforum.org  

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

Reply
 
Thread Tools
Old 2020-06-01, 22:37   #12
Bobby Jacobs
 
Bobby Jacobs's Avatar
 
May 2018

33·7 Posts
Default

Yes. 282332382833 is a cool number. It reminds me of the maximal prime gap between 352521223451364323 and 352521223451365651, and the maximal prime gap after 6787988999657777797.
Bobby Jacobs is offline   Reply With Quote
Old 2020-06-03, 16:38   #13
sweety439
 
sweety439's Avatar
 
Nov 2016

13·167 Posts
Default

Quote:
Originally Posted by Bobby Jacobs View Post
Yes. 282332382833 is a cool number. It reminds me of the maximal prime gap between 352521223451364323 and 352521223451365651, and the maximal prime gap after 6787988999657777797.
How about searching gaps between primes having primitive root 2? I think 2 is more natural, it is no reason to search gaps between primes having primitive root 10.

For primitive root 2, a gap of 8k+4 does not exist, since all primes having primitive root 2 are == 3, 5 (mod 8)

Code:
gap  prime
2  3
6  5
8  29
10  19
14  149
16  37
18  83
22  421
24  107
26  587
30  317
32  2099
34  619
38  2621
40  1693
42  227
46  1381
48  709
50  3203
54  2477
56  4547
58  12979
62  4157
64  4723
66  1307
70  4021
72  947
74  1787
78  5573
80  12659
82  23251
86  20357
88  9949
90  13523
94  18493
96  15971
98  14243
102  33637
104  3083
106  63667
110  20789
112  24547
114  9059
118  88093
120  11317
122  109619
126  70717
128  46349
130  49891
134  244109
136  70237
138  105691
142  132709
144  18269
146  425387
150  221261
152  266117
154  62323
158  235541
160  31699
162  139907
166  102877
168  65371
170  142211
174  199037
176  265163
178  296299
182  223829
184  411013
186  137723
190  699757
192  191837
194  658643
198  103093
200  339827
202  302227
206  2989757
208  806581
210  425603
214  155797
216  598427
218  184259
222  736469
224  514949
226  2373307
230  1530293
232  1078411
234  512819
238  1427509
240  370133
242  1353371
246  2084653
248  476603
250  2551099
254  4013573
256  2617651
sweety439 is offline   Reply With Quote
Old 2020-06-03, 18:00   #14
mart_r
 
mart_r's Avatar
 
Dec 2008
you know...around...

13·43 Posts
Default

Quote:
Originally Posted by sweety439 View Post
How about searching gaps between primes having primitive root 2? I think 2 is more natural, it is no reason to search gaps between primes having primitive root 10.
You're on!

You could calculate the merits via Artin*gap/log(p) and look for bounds in the CSG analogue Artin*gap/logĀ²(p). It'd be interesting to see if there are some extraordinarily large gaps. If not in base 2, you could check other bases as well.
mart_r is offline   Reply With Quote
Old 2020-06-30, 12:42   #15
sweety439
 
sweety439's Avatar
 
Nov 2016

13×167 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Also see https://de.wikipedia.org/w/index.php...ldid=195978132 for 2<=m<=128, 1<=n<=128 (0 if not exist). (I searched up to p=2^24, and I assume that there are no p>2^24 which is the smallest prime such that znorder(Mod(m,p)) = (p-1)/n for some m,n <= 128, in the list, the largest such prime is 2334251 (for m=126, n=125), and 2334251 is just between 2^21 and 2^22)
They are in https://en.wikipedia.org/w/index.php...ldid=964864733, for 2<=m<=128, 1<=n<=128 (0 if not exist)
sweety439 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Gaps of Primes? PawnProver44 Miscellaneous Math 10 2016-04-10 19:32
Primitive roots for a set of primes mart_r Math 0 2013-07-20 12:23
Primitive Roots Numbers Math 16 2005-09-21 23:41
Is 3 always a primitive root for mersenne primes? juergen Math 12 2005-03-09 08:18
Is 3 always a primitive root for mersenne primes? juergen Programming 9 2005-03-08 03:51

All times are UTC. The time now is 16:08.

Sat Aug 15 16:08:41 UTC 2020 up 2 days, 12:44, 0 users, load averages: 1.63, 1.79, 1.81

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.