mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2019-04-14, 05:13   #12
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by rudy235 View Post
That is an interesting question. I believe it is a number "slightly" over 4*1018
We've certainly gone over 6787988999657777797 > 6.7*1018 on these very boards. Someone with more patience can look up the exact bounds.
CRGreathouse is offline   Reply With Quote
Old 2019-04-14, 05:34   #13
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

11000001101002 Posts
Default

The original question is not clear. The word "known" is undefined in the context.

However, if we assume "known" to mean something like "is stored somewhere (in a brain, on an HDD, or anywhere retrievable)" then I expect there is no way we (as a collective global group) "know" all the primes up to 1018. The storage requirements are too extreme for any one entity to bother with. Disparate groups and individuals might have particular ranges stored in various places, but AFAICT there has been no coordination to close all the gaps and ensure a contiguous range.

While it might be true that all primes have been computed or identified up to 1018 (or more perhaps?), I don't see any evidence that those primes have been permanently recorded anywhere. What would people do with such a huge DB anyway? It is probably easier to simply recompute any range anyone is interested in, than trying to read the primes out of some enormous storage array.

Last fiddled with by retina on 2019-04-14 at 05:35
retina is offline   Reply With Quote
Old 2019-04-14, 06:02   #14
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

2×7×71 Posts
Default

Quote:
Originally Posted by retina View Post
The original question is not clear. The word "known" is undefined in the context.

However, if we assume "known" to mean something like "is stored somewhere (in a brain, on an HDD, or anywhere retrievable)" then I expect there is no way we (as a collective global group) "know" all the primes up to 1018. The storage requirements are too extreme for any one entity to bother with. Disparate groups and individuals might have particular ranges stored in various places, but AFAICT there has been no coordination to close all the gaps and ensure a contiguous range.

While it might be true that all primes have been computed or identified up to 1018 (or more perhaps?), I don't see any evidence that those primes have been permanently recorded anywhere. What would people do with such a huge DB anyway? It is probably easier to simply recompute any range anyone is interested in, than trying to read the primes out of some enormous storage array.

What you say is very true, the primes are probably deleted as soon as the researcher finishes mining the data he/she is looking for.

For instance, an exact count of Twin primes, Cousin, primes, sexy primes, gaps between pairs of Twin primes, exact count of triplets p, p+2 p+6 and p, p+4, p+6, quadruplets, Sophie Germain prime pairs, Cunningham prime pairs, etc.

However, the fact they are NOT stored is a convenience factor. As you well say they can be recomputed and there is very little need to keep several exabytes of frozen storage.
rudy235 is offline   Reply With Quote
Old 2019-04-14, 21:04   #15
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

1000000001112 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
Curiously, this is still less than 2^64, the maximum value for primelimit offered by Pari-GP for 64-bit machines.

This leads me to wonder -- what is the largest value for primelimit people actually use commonly? (The default is 500k.)
it seems to me that there actually isn't any way of changing the actual primelimit in Pari-GP.

Quote:
This default is only used on startup: changing it will not recompute a new table.
https://pari.math.u-bordeaux.fr/dochtml/html-stable/

You can use the default() function to change the primelimit value, but this does not seem to actually do anything other than change the system variable. No new primes are added to the "table". You will have to manually compute and then add the primes to the list.

I'd love to be corrected on this.


Chances are that the available memory on the PC will determine the real upper limit.

Here is a relevant thread:

Largest Primorial that would Fit on a Terabyte Drive.

Last fiddled with by a1call on 2019-04-14 at 21:09
a1call is offline   Reply With Quote
Old 2019-04-15, 22:16   #16
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

3·5·137 Posts
Default

So I did some experimentation and these seem to be the results.
Increasing the primelimit to 19^6, did not add any primes to the table. Afterwards using a factor function to the limit of 19^6 finished in a few minutes and did not add any calculated:used primes to the table. Then I tried to do a forprime 500000 to 19^6 and add the primes using addprimes function. After a few hours I gave up and tried smaller upper bound of 3*19^5 which probably took about couple of hours to conclude.
a1call is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
A conjecture about Mersenne primes and non-primes Unregistered Information & Answers 0 2011-01-31 15:41
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

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


Sat Jul 17 03:39:56 UTC 2021 up 50 days, 1:27, 1 user, load averages: 1.38, 1.58, 1.59

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.