Waste less time on Facebook — follow Brilliant.

Will approximate for pi: (Potentially) a new note series

Approximations for \(\pi\) have always fascinated me. When I was younger I always interpreted \(\pi\) as some arbitrary constant relating the diameter of a circle to its perimeter, but it's really so much more than that. Circles appear so frequently in math that \(\pi\) is everywhere. In this (potential) series, I will go over and prove various formulas for \(\pi\).

In this first one, we will go over a very famous one: \(\displaystyle \sum_{n = 1}^{\infty} \frac{1}{n^2} = \frac{\pi^2}{6}\), and Euler's proof (with more rigor) of the fact in \(1735\). Let's get started.

The Weierstrass Factorization Theorem says that entire functions (if you do not know what that is, don't sweat it) with complex roots \(c_1, c_2, \dots, c_r\) can be written as \(a\prod_{i = 1}^r (z - c_i)\), where \(a\) is a non-zero constant. For polynomials, this may not seem very remarkable, but this allows us to do things with functions like cosine and the exponential function. This may seem unrelated to our problem, but it is not.

Let us examine \(\frac{\sin x}{x}\). This function has roots at \(\pm k \pi\) for \(k \in \mathbb{Z}_+\). Thus, by this theorem we can write \[ \frac{\sin x}{x} = a(x - \pi)(x + \pi)(x - 2 \pi)(x + 2 \pi)(x - 3 \pi)(x + 3 \pi) \dots .\]

We can then group terms to get \[ \frac{\sin x}{x} = a(x^2 - \pi^2)(x^2 - 4 \pi^2)(x^2 - 9 \pi^2) \dots .\]

Now we are getting closer to our original goal. We have an infinite sequence of squares, but we want those squares to be in the denominator. So let's divide \(x^2 - n \pi^2)\) by \((-n \pi^2\) to get \((1 - \frac{x^2}{n^2 \pi^2})\). Note that after we do this, \(a\) will be different, so for clarity let's call it some other constant \(c\).

\[ \frac{\sin x}{x} = c\left(1 - \frac{x^2}{\pi^2}\right)\left(1 - \frac{x^2}{4 \pi^2}\right)\left(1 - \frac{x^2}{9 \pi^2}\right) \dots . \]

The next step is to determine \(c\). Recall that \(\lim \limits_{x \to 0} \frac{\sin x}{x} = 1\). Thus, at \(x = 0\), the equation becomes \(1 = c(1)(1)(1)\dots\). So hey, \(c\) is \(1\)! How convenient. So our function becomes \[ \frac{\sin x}{x} = \left(1 - \frac{x^2}{\pi^2}\right)\left(1 - \frac{x^2}{4 \pi^2}\right)\left(1 - \frac{x^2}{9 \pi^2}\right) \dots . \]

Now let's quickly consider the Taylor/MacLaurin series for \(\frac{\sin x}{x}\) centered at \(x = 0\). Most of you took Calc II and probably know this, but just to remind you, this is \(1 - \frac{x^2}{6} + \frac{x^4}{120} - \frac{x^6}{7!} \pm \dots\). So, the function that we found ourselves above should be equal to this function. It will be significantly difficult to compare the whole function, so let's just compare the \(x^2\) coefficients -- they should be equal. The coefficient of it in this function is \(- \frac{1}{6}\).

In our above function, the \(x^2\) term will be determined by "picking" one \(\frac{-x^2}{n^2 \pi^2}\) in one of the binomials and "picking" \(1\) in the rest of them. Thus, the coefficient \(x^2\) term is equal to \(-(\frac{1}{\pi^2} + \frac{1}{4 \pi^2} + \frac{1}{9 \pi^2} + \dots)\). And now we're home free:

\[-\frac{1}{6} = -(\frac{1}{\pi^2} + \frac{1}{4 \pi^2} + \frac{1}{9 \pi^2} + \dots)\]

\[\frac {\pi^2}{6} = (1 + \frac{1}{4} + \frac{1}{9} + \dots) = \displaystyle \sum_{n = 1}^{\infty} \frac{1}{n^2}\]

And we get our desired equality!

Regarding the approximation itself, it certainly isn't the fastest one out there (we will investigate that one, by Ramanujan, in the last installation of this series, since it is a monster), but it is not the slowest either. When determining how quick an algorithm will yield convergence, it is good to look at the relative size of each term. If each term is only a little bit smaller than the last, then that usually means it converges slowly.

That's it for now. I hope you enjoyed reading this and I hope this was educational to you. Next time, we will investigate the Wallis Product \[\frac {\pi}{2} = \frac{2*2*4*4*6*6*8*8* \dots}{1*3*3*5*5*7*7*9* \dots}\]

That one will be shorter as we've already done all the work in this one!

Note by Michael Tong
3 years ago

No vote yet
1 vote


Sort by:

Top Newest

These are not approximations for \(\pi\). These are formulae expressing \(\pi\) as the limit of an infinite series or an infinite product. An integral is a form of limit. We would not call the formula \[ \pi \; = \; 4\int_0^1 \tfrac{dx}{1+x^2} \] an approximation for \(\pi\).

Of course, given an infinite series formula, approximations for \(\pi\) can be obtained by taking finite partial sums. Thus \[ \begin{array}{rcl} \pi & \approx & 4\Big(\tfrac{1}{1} - \tfrac{1}{3} + \tfrac{1}{5} - \cdots + \tfrac{1}{101}\Big) \\ & \approx & \sqrt{6\sum_{j=1}^{1000} j^{-2}} \end{array} \] are approximations for \(\pi\).

Some interesting approximations for \(\pi\) are ones that come from the continued fraction expansion of \(\pi\), such as \(\tfrac{22}{7}\), \(\tfrac{333}{106}\) and \(\tfrac{355}{113}\). These approximations all had their heyday in the history of mathematics (before calculators existed \(\tfrac{22}{7}\) was widely used as an approximation for \(\pi\) to simplify calculations in schools, for example), and they are in an important sense the best possible. For example, \(\tfrac{22}{7}\) is the best approximation for \(\pi\) by a rational with denominator \(7\) or less, and the error is less than \(\tfrac{1}{7^2}\), while \(\tfrac{333}{106}\) is the best approximation for \(\pi\) by a rational with denominator \(106\) or less, and the error is less than \(\tfrac{1}{106^2}\). Mark Hennings · 3 years ago

Log in to reply

It is interesting to see that there is an elementary, first principles, proof of this result. Using de Moivre's formula, \[ \begin{array}{rcl} \sin(2n+1)x & = & \mathfrak{Im}\left[(\cos x + i \sin x)^{2n+1}\right] \\ & = & \sum_{k=0}^n (-1)^k{2n+1 \choose 2k+1}\cos^{2(n-k)}x\sin^{2k+1}x \\ & = & \sin^{2n+1}x\sum_{k=0}^n (-1)^k{2n+1 \choose 2k+1}\cot^{2(n-k)}x \\ & = & \sin^{2n+1}xf_n\big(\cot^2x\big) \end{array} \] where \[ f_n(X) \; = \; \sum_{k=0}^n (-1)^k {2n+1 \choose 2k+1} X^{n-k} \; = \; {2n+1 \choose 1}X^n - {2n+1 \choose 3}X^{n-1} + \cdots \] is a polynomial of degree \(n\). It is clear that the roots of \(f_n(x)\) are \(\cot^2\tfrac{j\pi}{2n+1}\) for \(1 \le j \le n\), and hence \[ \sum_{j=-1}^n \cot^2\tfrac{j\pi}{2n+1} \; = \; {2n+1 \choose 3}{2n+1 \choose 1}^{-1} \; = \; \tfrac13n(2n-1) \] For any \( 0 < x < \tfrac12\pi\) we have \(\sin x < x < \tan x\), and hence \(\cot^2x < x^{-2} < \csc^2x = 1 + \cot^2x\). Thus \[ \cot^2\tfrac{j\pi}{2n+1} \; < \; \frac{(2n+1)^2}{j^2\pi^2} \; < \; 1 + \cot^2\tfrac{j\pi}{2n+1} \] for \(1 \le j \le n\), and hence \[ \begin{array}{rcccl} \sum_{j=1}^n \cot^2\tfrac{j\pi}{2n+1} & < & \frac{(2n+1)^2}{\pi^2}\sum_{j=1}^n j^{-2} & < & n + \sum_{j=1}^n \cot^2\tfrac{j\pi}{2n+1} \\ \tfrac13n(2n-1) & < & \frac{(2n+1)^2}{\pi^2}\sum_{j=1}^n j^{-2} & < & \tfrac23n(n+1) \\ \frac{n(2n-1)\pi^2}{3(2n+1)^2} & < & \sum_{j=1}^n j^{-2} & < & \frac{2n(n+1)\pi^2}{3(2n+1)^2} \\ 0 \; < \; \frac{\pi^2}{6(2n+1)^2} & < & \tfrac16\pi^2 - \sum_{j=1}^n j^{-2} & < & \frac{\pi^2(6n+1)}{3(2n+1)^2} \; < \; \frac{\pi^2}{2(2n+1)} \end{array} \] which proves the required convergence, and gives an error bound, so that the error of the \(n\)th partial sum is \(O(n^{-1})\).

By looking at the next coefficient in \(f_n(x)\), we can also show that \[ \sum_{j=1}^\infty j^{-4} \; = \; \tfrac{1}{90}\pi^4 \] Mark Hennings · 3 years ago

Log in to reply

If a lot of people like this I will certainly try to explain as many as I can. Remember to like and more importantly reshare so other people can look at it ^^

Also what do you think of the title? I thought it was clever. It's like "will work for food" or something :D Michael Tong · 3 years ago

Log in to reply

@Michael Tong Liked!! Mardokay Mosazghi · 3 years ago

Log in to reply

@Michael Tong Liked! Mursalin Habib · 3 years ago

Log in to reply

@Michael Tong Liked and reshared !! The proof's beautiful. :) Shaan Vaidya · 3 years ago

Log in to reply

Woah! I actually understood this! Thanks for this awesome note! Can't wait for the Wallis product! Finn Hulse · 3 years ago

Log in to reply

@Finn Hulse Hopefully you'll say the same thing when I try to explain the Ramanujan approximation ;) Michael Tong · 3 years ago

Log in to reply

@Michael Tong It takes a genius to figure out Ramanujan's approximation. That formula is so contrived one can only imagine how Ramanujan thought up of it. Daniel Liu · 3 years ago

Log in to reply

well if you really believe those guys at HistoryTV 18 then aliens told Ramanujan the whole thing .

also can anyone tell me wether the value of pi changes in some other geometry that is non-euclidean Adeen Shukla · 3 years ago

Log in to reply

will soomeone tell me how the value of pi changes or not changes in some other non euclidean geometry? Adeen Shukla · 3 years ago

Log in to reply

When's the next post coming?! Or has it already come? Parth Thakkar · 3 years ago

Log in to reply

well explained Iqra Yasin · 3 years ago

Log in to reply

Here's a good approximation: \(\pi\ = 2*e/\sqrt{3}\) Graham Van Goffrier · 3 years ago

Log in to reply

excelent Bhupesh Kocharekar · 3 years ago

Log in to reply

Talking about the infinite series for expressing \(\pi\), one cannot be forgotten is an Indian mathematician Srinivasa Ramanujan for publishing dozens of innovative new formulae for \(\pi\), remarkable for their elegance, mathematical depth, and rapid convergence. This series is taken from Ramanujan's notebook.\[\] \[ \frac{1}{\pi}=\frac{2\sqrt{2}}{9801}\sum_{k=0}^\infty\frac{(4k)!(1103+26390k}. \] \[\]This series converges much more rapidly than \(\zeta(2)=\sum\limits_{n=1}^\infty\dfrac{1}{n^2}=\dfrac{\pi^2}{6}\). Tunk-Fey Ariawan · 3 years ago

Log in to reply

Elegantly explained. :3 Vishnuram Leonardodavinci · 3 years ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...