This formula may let you compute a decimal digit of without computing all the previous digits:
It was discovered here:
• Gert Almkvist and Jesús Guillera, Ramanujan-like series for and string theory, Experimental Mathematics, 21 (2012), 223–234.
They give some sort of argument for it, but apparently not a rigorous proof. Experts seem to believe it:
• Tito Piezas III, A compilation of Ramanujan-type formulas for
It’s reminiscent of the famous Bailey–Borwein–Plouffe formula for
This lets you compute the nth hexadecimal digit of without computing all the previous ones. It takes cleverness to do this, due to all those fractions.
A similar formula was found by Bellard:
Between 1998 and 2000, the distributed computing project PiHex used Bellard’s formula to compute the quadrillionth bit of which turned out to be… [drum roll]…
A lot of work for nothing!
No formula of this sort is known that lets you compute individual decimal digits of but it’s cool that we can do it for at least if Almkvist and Guillera’s formula is true.
Someday I’d like to understand any one of these Ramanujan-type formulas. The search for lucid conceptual clarity that makes me love category theory runs into a big challenge when it meets the work of Ramanujan! But it’s a worthwhile challenge. I started here with one of Ramanujan’s easiest formulas:
But the ideas involved in this formula all predate Ramanujan. For more challenging examples one could try this paper:
• Srinivasa Ramanujan, Modular equations and approximations to Quarterly Journal of Mathematics, XLV (1914), 350–372.
Here Ramanujan gave 17 formulas for pi, without proof. A friendly-looking explanation of one is given here:
• J. M. Borwein, P. B. Borwein and D. H. Bailey, Ramanujan, modular equations, and approximations to pi or How to compute one billion digits of pi, American Mathematical Monthly 96 (1989), 201–221.
So, this is where I’ll start!