TITLE: Chudnovsky algorithm and Pi precision
QUESTION [2 upvotes]: What are the precision/ number of correct Pi digits after N iterations of Chudnovsky algorithm. Looking for a formula (rather than a table) and reference.

REPLY [6 votes]: [I'm following up on my comment, in response to Wojowu's query:]
The number of digits $d$ of $1/\pi=\sum_{k=0}^\infty c_k$ produced per iteration by the Chudnovsky algorithm, which has a linear convergence, follows from $10^d=\lim_{k\rightarrow\infty}|c_{k}/c_{k+1}|$, hence
$$d={}^{10}\log 151931373056000=14.1816\cdots$$

in connection with the unusual logarithm notation, I asked at HSM and got an informative response: the notation from the early 19th century for the base of the logarithm by A.L. Crelle was a superscript either in front $^{b}\!\log$ or above $\overset{b}{\log}$ --- see page 107 of A History of Mathematical Notations (volume II).
{"set_name": "stack_exchange", "score": 2, "question_id": 261162}