Computation of 2700 billion decimal digits of Pi using a Desktop Computer

@inproceedings{Jan2010ComputationO2,
  title={Computation of 2700 billion decimal digits of Pi using a Desktop Computer},
  author={Fabrice Bellard Jan},
  year={2010}
}
  • Fabrice Bellard Jan
  • Published 2010
We assume that numbers are represented in base B with B = 264. A digit in base B is called a limb. M(n) is the time needed to multiply n limb numbers. We assume that M(Cn) is approximately CM(n), which means M(n) is mostly linear, which is the case when handling very large numbers with the Schönhage-Strassen multiplication [5]. log(n) means the natural logarithm of n. log2(n) is log(n)/ log(2). SI and binary prefixes are used (i.e. 1 TB = 1012 bytes, 1 GiB = 230 bytes). 

References

Publications referenced by this paper.
Showing 1-9 of 9 references

A new formula to compute the n’th binary digit of Pi

Fabrice Bellard
1997
View 1 Excerpt

Approximations and complex multiplication according to Ramanujan, in Ramanujan Revisited

D. V. Chudnovsky, G. V. Chudnovsky
1988
View 1 Excerpt

An algorithm for the machine calculation of complex

Cooley, W James, John W. Tukey
Fourier series, Math. Comput • 1965
View 1 Excerpt

An algorithm for the machine calculation of complex Fourier series ,

James W. Cooley, John W. Tukey
Math . Comput . • 1965

Similar Papers

Loading similar papers…