Re: Salamin-Brent algorithm
- From: Chip Eastham <hardmath@xxxxxxxxx>
- Date: Fri, 22 Jun 2007 01:00:08 -0000
On Jun 21, 6:42 pm, Gerry Myerson <g...@xxxxxxxxxxxxxxxxxxxxxxxxx>
wrote:
In article <1182447514.837296.169...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
dgoldsmith_89 <d.l.goldsm...@xxxxxxxxx> wrote:
if I can just download say like
the first 2^100 binary digits (or 16^25 hex....
Um, 2^100 digits - where would you put them all? Seriously.
Anyway, no one has computed more than a few billion digits
(or bits, or whatever), which is way less than what you want.
Well, I agree with the thought (no one would have
room for 2^100 bits), but actually the computation
of pi has been carried out to one trillion places
(10^12) in both decimal and hexidecimal arithmetic.
http://www.super-computing.org/pi_current.html
as of Oct. 20, 2005.
regards, chip
.
- Follow-Ups:
- Re: Salamin-Brent algorithm
- From: dgoldsmith_89
- Re: Salamin-Brent algorithm
- References:
- Re: Salamin-Brent algorithm
- From: Gerry Myerson
- Re: Salamin-Brent algorithm
- Prev by Date: Re: I agree with gödel and matheyasevich : Mathematics is too hard for mathemat
- Next by Date: Re: A determinant problem
- Previous by thread: Re: Salamin-Brent algorithm
- Next by thread: Re: Salamin-Brent algorithm
- Index(es):