Huray! It was Pi day last week! To celebrate this, I will sketch the solution of a well-known problem in which pi shows up unexpectedly. One entertaining introduction video about this problem can be found here.
The Basel Problem
More than 300 years ago, Pietro Mengoli posed the Basel problem. A series is an addition of a sequence of numbers. One simple sequence is the addition of all integers: . This mathematical shorthand notation for this is . It means, sum over all integers starting from one and never stop. As you can see, this number grows every time a number is added and therefore, this series diverges. That is, the more terms are added, the bigger the number becomes.
Some series are convergent. That is, the more numbers you add, the closer the summation of the terms grows towards a fixed number. In the Basel problem, we look at the following series: . Strangely, this number grows towards the constant . If we look at the first term, we have . The second term is . The third term is . The fourth term equals . If we add up the first four terms, we get . The fifth term equals , the sixth term is equal to and the seventh term and the eight term . If we add up the first eight terms, we get . If we make the number of terms larger and larger, we will get closer and closer to . What is this number exactly? Euler showed that this number equals , so here pi shows up! In the next section, the process of finding is explained.
The Pi-eautful Solution
Why ? How is involved here? And what is the doing there? In order to make these connection, we first have to know some underlying theorems.
Factorization of Polynomials
The fundamental theorem of algebra states that every single-variable polynomial (lines, parabolas and other formulas involving weighted sums of powers of one variable) can be factored into a product of linear factors and irreducible quadratic factors. For example, take the single-variable polynomial . We know that is a solution and is a solution. This polynomial can be factored into . If you multiply this out, you indeed get . This fact will be used in the proof.
Every function can be approximated by its Taylor series. In the proof, Euler approximated the function . In a while, we will see why. The Taylor series expansion of equals . Dividing both sides by yields the following: .
Towards a solution
By combining both methods (both the Fundamental Theorem of Algebra and the Taylor approximation of , we can solve the riddle! Euler first looked at the following function: . Notice that the roots of this function are simply the roots of (except for ). Why? Suppose that is a root of . So, . Then, . Nice! If you are interested, you can figure out that any root of is indeed a root of (except for ). The roots of are well known and are for any integer . Thus, the roots of are for any integer except for . By the Fundamental Theorem of Algebra (and by using the Weierstrass Factorization which I will not explain here), we know that using the roots, we can create an approximating polynomial for the function: . Notice that for any zero of the function this approximation will indeed yield .
Now we can gather all quadratic terms here: . This is found by computing the products of each pair of consecutive factors in the Weierstrass Factorization. If we now only consider the quadratic terms, we find . If we look at the quadratic terms in the Taylor expansion, we find that .
Now we have found the solution by equating these two solution! Namely: , thus . Therefore: . Nice!
By combining two theorems, Euler showed that – which is quite surprising. If you feel this sketch is not rigorous enough or if you would like to add something, feel free to join the discussion below this post. Also feel free to ask any questions!
Help building the Data Blogger CommunityHelp to grow our community to spread AI and Data Science education around the globe.
Every penny counts.