![]() |
![]() |
#1 |
"Luke Richards"
Jan 2018
Birmingham, UK
25×32 Posts |
![]()
We know all primes, p such that p < 10: 2, 3, 5 7
We do not know all primes, r, such that r < 282,589,933-1 Therefore there is a prime, q, such that all primes less than q are known and proven, but there are primes greater than q not known. What estimates can you make for the size of q? |
![]() |
![]() |
![]() |
#2 | |
Feb 2017
Nowhere
10110110011002 Posts |
![]() Quote:
Pari-GP offers values of primelimit, the upper bound on the list of precomputed primes, of 232 or 264, according to whether you have a 32-bit or 64-bit machine. I'm guessing the precomputation of all primes up to 264 might take a while, and the resulting vector of primes might use up a bit of RAM... |
|
![]() |
![]() |
![]() |
#3 | |
Jun 2015
Vallejo, CA/.
11×101 Posts |
![]() Quote:
Tomas Oliveira e Silva computed all prime numbers up to that limit exactly 7 years ago in April 2012. See http://sweet.ua.pt/tos/gaps.html Perhaps –because it is relatively easy to do– someone else with the right equipment has computed 1015 over that limit. Last fiddled with by rudy235 on 2019-04-11 at 14:07 Reason: spelling |
|
![]() |
![]() |
![]() |
#4 |
Jan 2017
2×73 Posts |
![]()
I'm not sure this is a meaningful question. People don't actually use such lists of primes. What does it mean for a prime to be "known"? That someone has in principle run a probabilistic primality test on it, then thrown away the result?
For comparison, what do you think is the largest number such that someone has counted up to it, but no one has counted further? |
![]() |
![]() |
![]() |
#5 |
"Vincent"
Apr 2010
Over the rainbow
5·569 Posts |
![]()
Remeber that the universe has *only * 10^78 to 10^82 atoms.
Last fiddled with by firejuggler on 2019-04-12 at 15:06 |
![]() |
![]() |
![]() |
#6 | |
"Luke Richards"
Jan 2018
Birmingham, UK
25·32 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
"Luke Richards"
Jan 2018
Birmingham, UK
25×32 Posts |
![]() |
![]() |
![]() |
![]() |
#8 |
Aug 2006
3×1,993 Posts |
![]()
It gives a hard upper bound on the number of "known" primes, depending on the representation used of course. Say an atom represents a bit and the primes are written in binary, then you can't know all the primes higher than ~ 7e81 because you run out of space.
|
![]() |
![]() |
![]() |
#9 | |
"Luke Richards"
Jan 2018
Birmingham, UK
4408 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#10 | |
Jun 2015
Vallejo, CA/.
100010101112 Posts |
![]() Quote:
I don't have any special predictive ability but I would say that the actual limit which is 4*1018 (which was reached on April 2012) can be at most be squared to 1.6*1037 and I don't expect anyone who is alive now will be alive if and when this happens. |
|
![]() |
![]() |
![]() |
#11 | |
Feb 2017
Nowhere
22×1,459 Posts |
![]() Quote:
This leads me to wonder -- what is the largest value for primelimit people actually use commonly? (The default is 500k.) |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 |