I know that, as a hobbyist mathematician, this is generally a term we can use to express pi
\begin{equation*} \frac{\pi}{4} = 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \frac{1}{9} - \frac{1}{11} + \frac{1}{13} - \frac{1}{15} + \frac{1}{17} - \cdots \end{equation*}
This is great representation , and it works just fine
However, I've been introduced to some iterative series recently (they're great for finding the roots to an equation by the way) and I was wondering, if there was a iterative series for pi, could we get a more justified value?
I've looked online, and there only seems to be geometric expressions using sine and cosine.
I was wondering if a numerical formula could be derived.
Edit: An iterative series is a series much like an algorithm, for example (N+1) = root(N+ 2/N) the idea being this series will converge on a value
Not sure what exactly it is that you want, but if you take newton's method and the power series of $\sin$ and $\cos$, you'll get $\pi$ as the limit of the newton iterations for $x_0 = 3$ and $x_{k+1} = x_k - \tan(x_k)$ where $\cot$ has a power series wich you can chose to evaluate up to an increasing degree, say $k$ to get $$x_{k+1} = x_k - T_k[\tan](x_k)$$ Where $T_k[f]$ is the $k$-th sum of the Taylor series of $f$ at a predefined point near $\pi$ ($3$ for example). This will give you a new polynomial term each iteration but it forms a sequence with $\lim_{k\to\infty} x_k = \pi$.
See here for $T_k[\tan]$