Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site eagle.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!mhuxn!mhuxr!ulysses!eagle!mjs
From: mjs@eagle.UUCP (M.J.Shannon)
Newsgroups: net.sources
Subject: Re: Solving Pi
Message-ID: <1299@eagle.UUCP>
Date: Sun, 28-Jul-85 12:39:13 EDT
Article-I.D.: eagle.1299
Posted: Sun Jul 28 12:39:13 1985
Date-Received: Mon, 29-Jul-85 07:49:03 EDT
References: <187@ski.UUCP> <11307@watnot.UUCP>
Organization: AT&T Bell Laboratories, Summit, NJ
Lines: 28

> In article <187@ski.UUCP> eeg@ski.UUCP (eeg systems (bcx) writes:
> [ article deleted - program to calculate pi to X digits ]
> >**	      infinity                    infinity
> >**	      ____  16*(-1e(k+1))         ____  4*(-1e(k+1))
> >**	      \                           \
> >**	pi =   >    -------------    -     >    ------------
> >**	      /                           /
> >**	      ----  (2k-1)*5e(2k-1)       ----  (2k-1)*239e(2k-1)
> >**	      k = 1                       k = 1
> >**
> 
> Here is a more simple sum-evaluation of pi (thought I don't know if it will work
> with the original program):
> 
>                oo
>             ----         k-1
>             \        (-1)
>     pi = 4   >    ----------
> 	      /       2k-1
> 	      ----
> 	      k=1

The reason why the 2 infinite sums are used is that the single infinite sum
converges *VERY* slowly.
-- 
	Marty Shannon
UUCP:	ihnp4!eagle!mjs
Phone:	+1 201 522 6063