|
|
|
|
|
|
by bakul
2467 days ago
|
|
|
> this simple one still converges at about 0.6 decimal digits per term. The Chudnovsky brothers’ algorithm computes 14.18... digits per term. Its implementation in Scheme is only about a couple dozen lines of code. It computes a million pi digits in about 17.5 seconds on raspberry pi 4 in Gambit Scheme (57 seconds on the original raspberry pi, IIRC). |
|
|