This is the Chudnovsky algorithm for computing the digits of pi: https://en.wikipedia.org/wiki/Chudnovsky_algorithm
It has a term q which sets the upper bound on the number of iterations run on the algorithm. However, on this page, there's no relation between q and the number of correct digits that that q will produce. What is the relation between the two?