20060112, 15:39  #1 
Einyen
Dec 2003
Denmark
3,253 Posts 
pi(x) project
I found this pi(x) project page. They found pi(10^23) but it had a +1 error.
I was wondering how do they actually calculate pi at those ranges, I mean there are 1.724*10^21 primes between 10^22 and 10^23 (http://mathworld.wolfram.com/PrimeCountingFunction.html), they can't actually prove all those numbers prime? Anyone continuing pi(x) above 10^23? 
20060118, 04:31  #2  
Feb 2005
11111101_{2} Posts 
From SeqFan:
Quote:


20060830, 04:02  #3  
Aug 2006
13533_{8} Posts 
Quote:
There are good sublinear algorithms out there, though, that make this possible as a distributed system  but the error you point out made them stop the project. 

20060830, 04:26  #4 
Dec 2003
Hopefully Near M48
6DE_{16} Posts 
So why was there a +1 error?

20060830, 17:59  #5 
Nov 2003
2^{2}·5·373 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Special project #3b  Project 400  schickel  Aliquot Sequences  307  20111028 01:29 
Special project #3a  Project 300  schickel  Aliquot Sequences  29  20110812 17:45 
Possible new project for RPS  robert44444uk  Riesel Prime Search  1  20100430 22:01 
pspproject.de down  opyrt  Prime Sierpinski Project  6  20100420 10:51 
new project  junky  NFSNET Discussion  18  20040308 03:05 