I need to understand very good how the properties of this formula
$\frac{4}{\pi} = \frac{5}{4} + \sum_{N \geq 1} \left[ 2^{-12N + 1} \times(42N + 5)\times {\binom {2N-1} {N}}^3 \right] $
Taken from the paper "Radian Reduction for Trigonometric Function" (Hanek Payne Algorithm)
Some remarkable properties are stated, specifically these four ones
- The $k^{th}$ term of the formula is exactly representable in $6k$ bits;
- The first $n$ terms of the sum can be represented exactly in $12n$ bits;
- The most significant bit of the $k^{th}$ term has weight at most $2^{1-6k}$ and hence each successive term increases the number of valid bits in the sum by at least $6$;
- If $12k < m + 1 \leq 12(k+1)$, then the $m^{th}$ bit of $\frac{4}{\pi}$ may be computed using only terms beyond the $k^{th}$.
My questions are: 1. How to prove the formula? 2. How to prove the properties stated above?
PS. I guess with terms the paper means the generic term $a_N$ of the sum...
We can prove the formula through the theory of elliptic integrals and modular forms.
That boils down to proving that:
$$ \sum_{n\geq 1}\binom{2n-1}{n}^3 x^n = -\frac{1}{8}+\frac{1}{2\pi^2}\left(K\left(\frac{1-\sqrt{1-64x}}{2}\right)\right)^2 $$ where $K$ is the complete elliptic integral of the first kind.
The remaining parts follow from the fact that $\binom{2n-1}{n}$ behaves like $\frac{4^n}{2\sqrt{\pi}} $ by Stirling's approximation.