So, I happened to find a slightly different version of the BBP algorithm (for calculating pi):

enter image description here

Is there any way, perhaps by using the original BBP algorithm, to get that 16*x[n-1] term for an arbitrary value of n? Thanks.

EDIT: I meant without actually summing up {16x[0] + {16x[ 1] ... to 16x[n]}}. Is there a faster way?

没有正确的解决方案

许可以下: CC-BY-SA归因
不隶属于 StackOverflow
scroll top