문제

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