Question

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?

Pas de solution correcte

Licencié sous: CC-BY-SA avec attribution
Non affilié à StackOverflow
scroll top