Computation of the n'th digit of pi in any base in O(n^2) (1997)

Re:Computation of the n'th digit of pi in any base in O(n^2)... by Funnyduck99 on Friday November 10, 2023 @08:56PM (#38226884)

Is this good? I would think finding nth digit of pi would be O(n)

[ Parent | on HN ]

Re:Computation of the n'th digit of pi in any base in O(n^2)... by sp332 on Friday November 10, 2023 @09:16PM (#38227009)

That only works until you run out of resolution in your floating-point representation. When you have to start manually keeping track of digits, that's when things slow down.

[ Parent | on HN ]

Re:Computation of the n'th digit of pi in any base in O(n^2)... by shzhdbi09gv8ioi on Saturday November 11, 2023 @07:29AM (#38229755)

If it's good? It took the world record in calculating Pi, so I'd say Yes, it was good.

> Bellard's formula was discovered by Fabrice Bellard in 1997. It is about 43% faster than the Bailey–Borwein–Plouffe formula (discovered in 1995).

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

[ Parent | on HN ]