20071012, 17:23  #1 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
3^{4}·71 Posts 
Finding primes from 1 upwards
has anyone seached exhautively for primes particularly high
i have seached the web but cannot find any projects if not what would be the best method for starting this search 
20071012, 17:40  #2 
∂^{2}ω=0
Sep 2002
República de California
3^{2}·1,093 Posts 

20071012, 17:58  #3  
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
41·109 Posts 
Quote:
There are some links to lists here: http://primes.utm.edu/lists/small/ 

20071012, 18:22  #4 
"Ben"
Feb 2007
3,343 Posts 
I guess it depends by what you mean by "particularly high". Here: http://www.ieeta.pt/~tos/primes.html, tables of pi(x) (the number of primes less than x) are given, and have been found/verified by the sieve of eratosthenes. It would be impractical/useless to write down all these primes. For instance, he gives pi(10^23) = 1925320391606803968923, which would take something like 17087218 peta bytes of storage if you wanted to list them all.
If you want to help find the biggest known primes, join GIMPS. Last fiddled with by bsquared on 20071012 at 18:23 
20071012, 19:08  #5 
Feb 2006
Denmark
E6_{16} Posts 
pi(x) can be computed much faster than computing all primes up to x. Only some of the pi(x) values up to pi(10^23) have been verified by the sieve of Eratosthenes. The largest exhaustive computation of primes is part of the Goldbach conjecture verification at http://www.ieeta.pt/~tos/goldbach.html. They reached 10^18 in April. pi(10^18) = 24,739,954,287,740,860 is also far too many primes to store. They were only kept shortly in ram.

20071012, 22:45  #6 
3×7×11×17 Posts 
Hmm, my old account (think of years, not month) is not active any more... anyways:
I still find this text about the practical limitations of computing and saving all primes to be rather good. It starts easy, but at the end it goes into detail about the limits of todays technologies. (clustering techniques etc. and where is will fail) http://www.troubleshooters.com/codec...imenumbers.htm 
20071013, 09:38  #7  
Bamboozled!
"𒉺𒌌𒇷𒆷𒀭"
May 2003
Down not across
2×5,099 Posts 
Quote:
Here's a list of primes from 14 upwards: 17, 19, 23, 29, ... I'll leave you to find the primes from 1 to 14. Paul Last fiddled with by xilman on 20071013 at 09:38 Reason: Fix speeling misteaks 

20071013, 13:33  #8 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5751_{10} Posts 
so how much disk space would it take to store the first 1,000,000 primes
i have previously written a vb.net program which uses the sieve of Eratosthenes to find all primes up to 2^30 it took about 90 second to run my program doesnt work any higher than that because the index for a bitarray has a max of (2^31)1 
20071013, 14:32  #9 
Jun 2003
7×167 Posts 

20071013, 14:41  #10  
"William"
May 2003
New Haven
2^{2}×3^{2}×5×13 Posts 
Quote:
http://www.rsok.com/~jrm/printprimes.html 

20071013, 16:12  #11 
Einyen
Dec 2003
Denmark
2·3·7·71 Posts 
I have a file taking 285,714,288 bytes with all primes up below 10,000,000,080 using the 48 bit / 210 integers format.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Finding VERY large primes  c10ck3r  Information & Answers  34  20120829 16:47 
Why arent there many softwares for finding Huge Primes  blistervol  Math  2  20120820 17:26 
Best Work for Finding Primes  Unregistered  Information & Answers  9  20120624 13:50 
Finding primes using modular stacking  goatboy  Math  1  20071207 12:30 
Finding primes with a PowerPC  rogue  Lounge  4  20050712 12:31 