id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
682	Fee, Greg	Catalan's Constant [Ramanujan's Formula]			.txt	text/plain	4212	3740	118	Catalan's Constant [Ramanujan's Formula] Catalan constant to 300000 digits computed on September 29, 1996 by using a Sun Ultra-Sparc in 1 day 8 hour 15 min 15 sec 55 hsec. The algorithm used is the standard series for Catalan, accelerated The algorithm was implemented using the LiDIA ftp://crypt1.cs.uni-sb.de/pub/systems/LiDIA/LiDIA-1.2.1.tgz http://www-jb.cs.uni-sb.de/LiDIA/linkhtml/lidia/lidia.html The implementation of the algorithm is: const_catalan (bigfloat & y) Calculating Catalan's constant to 300000 decimals Time required: 1 day 8 hour 15 min 15 sec 55 hsec Catalan constant is: sum((-1)**(n+1)/(2*n-1)**2,n=1..infinity) also known was due to Greg Fee and Simon Plouffe on August 14, 1996, and the standard implementation of Catalan on MapleV, Release 4. Euler Tranform: References, Abramowitz and Stegun, formula 3.6.27 Ramanujan Notebooks, part I formula 34.1 of page 293. Computation of Catalan's constant using Ramanujan's Formula, by Greg Fee, ACM 1990, Proceedings of the ISAAC conference, 1990, p. Catalan constant to 300000 digits	./cache/682.txt	./txt/682.txt