Somehow the answers have nothing to do with my question, so I must be asking wrong. I'm content to agree that the GPM-based program at https://gmplib.org/pi-with-gmp.html is a fine way to compute lots of digits of pi. It has zero pre-computation: there is no pi-specific data file that ships with the routine, everything is calculated by the program. The app I mentioned at the beginning of this thread has the opposite property: it does no computation, and instead ships with a pre-computed list of 10^8 digits, which it just searches. If you have a fast CPU and data storage is expensive, you would want the first option. If you have a slow CPU and cheap data storage, you would want the second. My question is, is there any CPU-speed-vs-storage-cost trade-off at which it makes sense to do something *other* than these two extremes? Or are these the only two plausible approaches for an app that answers "where does 23867242 first appear in pi?" --Michael On Wed, Apr 9, 2014 at 12:56 PM, Joerg Arndt <arndt@jjj.de> wrote:
https://gmplib.org/pi-with-gmp.html No reason to look elsewhere.
Best, jj
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Forewarned is worth an octopus in the bush.