So it looks like I will have to setup a super computer to calculate pi out to graham's digit. With the string->list idea I could be able to get up to 24 million before my computer crashes due to out of memory. Also I will look into the Bailey-Borwein-Plouffe formula, and hope to convert each digit from binary to base 10.
On Wednesday, August 15, 2012 11:39:12 PM UTC-7, Robert Bradshaw wrote: > > On Wed, Aug 15, 2012 at 5:55 PM, Eric Kangas > <eric.c...@gmail.com<javascript:>> > wrote: > > Yea crashing due to being out of memory. > > You could go a bit further by doing the string -> list of ints part > piecemeal. The memory usage of 1000 digits is 1000 + epsilon bytes, > but a list of 1000 ints is something like 24000+ bytes. > > > So I will have to convert from > > binary just to recall from mth to nth decimal place? > > The only (known) way to get the mth to nth decimal place is to compute > the whole thing to the nth decimal place, as a decimal number, then > ignore everything up to the mth. > > - Robert > -- -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
