20200502, 15:45  #1 
Mar 2020
1 Posts 
Not the largest prime
My apologies, I dont know my way around this forum. Could someone redirect this 'post' to the right place/ forum or do what is necessary? Or even answer it if there is a well known answer? Presumably the answer will get bigger as more primes are discovered
This is not a Mersenne question. What is the largest prime number for which all smaller primes are known? And secondly given the well known proof that there are an infinite number of primes, how many digits are there in the answer if all primes less than or equal to 'my' prime are multiplied together? 
20200502, 16:36  #2 
Romulan Interpreter
Jun 2011
Thailand
2×3×31×47 Posts 
Do you mean like they are all stored in a list, somewhere, or that we can produce them on request? If you read a bit about how the small primes are found, and how their primality is proven, you will find out that generating small primes is faster than reading them from an external memory support (like a hard disk) and due to that fact, nobody bother to "store" them. And about producing them, well, we can "produce" any sequence of primes in order below the limit where we can prove primality for general form (thousands of digits). So, I guess, we "know" all primes smaller than the "record" of primo or ecpp, just that they are not "stored" anywhere, and no human have seen most of them yet... (ha, is the prime "found" when a human sees it? who made this rule? )
Last fiddled with by LaurV on 20200502 at 16:37 
20200502, 19:32  #3 
P90 years forever!
Aug 2002
Yeehaw, FL
15764_{8} Posts 
In other words, there is no such prime below which all primes are known.
No one bothers to find such a prime because anyone with a computer could calculate the next prime in a few milliseconds. I guess the closest "pseudo answer" to your question is ~10^27. Someone posted on this forum a count for the exact number of primes less than 10^27. 
20200502, 19:43  #4  
Jun 2015
Vallejo, CA/.
31^{2} Posts 
Quote:
That is a good answer but more in the spirit of the questioner Tomas Oliveira e Silva fron the University of Aveiro Portugal calculated all primes below 4*10^{18} in July 2014 The article in Mathematics of Computation is entitled Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4ยท10^{18} As to the second question of the OP that would be Primorial (4*10^{18}) or (4x10^{18})# approximately e^{4*10^18} Last fiddled with by rudy235 on 20200502 at 19:44 

20200502, 22:51  #5  
"Robert Gerbicz"
Oct 2005
Hungary
11×127 Posts 
Quote:
To get a more real example: when we computed the large prime gaps on this forum up to 2^64 then we actually computed roughly 1/7 of all primes up to this bound. 

20200503, 01:46  #6  
Feb 2017
Nowhere
3×13×89 Posts 
Quote:
Alas, the answer is not known as precisely as one might wish, but still... What you want is a "reasonable" estimate for log(2) + log(3) + ... + log(p), where p is the largest prime <= X, X some "large" positive number. In PNTrelated literature, it is the natural log, log to the base e, or ln, that is used. And a statement equivalent to PNT is (ratio of RHS to LHS approaches 1 as X increases without bound) so that the number of decimal digits in the product of the primes up to X is something like X/ln(10). 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED!  dabaichi  News  561  20130329 16:55 
Largest known prime  Unregistered  Information & Answers  24  20081213 08:13 
Number of zero's in largest prime...  Heather  Math  90  20060401 22:06 
Largest 64 bit prime?  amcfarlane  Math  6  20041226 23:15 
need Pentium 4s for 5th largest prime search (largest proth)  wfgarnett3  Lounge  7  20021125 06:34 