Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

For the very naive, I assume FP math is not used in evaluating such constants. What then is in a toolkit used for such long decimals?


For the 12.1*10^12 calculation the refernced web site says: Hudnovsky algorithm [1] for the calculation, Bellard BBP formula for verification. Implementation in the programm y-cruncher "A Multi-Threaded Pi-Programy-chruncher" [3] For the math see [4] also.

[1] https://en.wikipedia.org/wiki/Chudnovsky_algorithm

[2] https://en.wikipedia.org/wiki/Bellard%27s_formula

[3] http://www.numberworld.org/y-cruncher/

[4] http://www.numberworld.org/misc_runs/pi-5t/details.html#form...


Check out the "Object Types" section of http://www.numberworld.org/ymp/v1.0/documentation/objects.ht...

The program has it's own types for arbitrary precision ints and floats.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: