Well, most of you would have definitely proved that the alternating sum of reciprocal of odd numbers equals \(\frac{\pi}{4}\).
Here's a more generalized case of the series
k=0∑∞(−1)k(mk+n)(mk+m−n)2k+1=m2πcsc(mnπ)
Proof
It can be easily proved that
∫0∞1+xmxn−1dx=mπcsc(mnπ)
by making the substitution y=1+xm1 and then the integral converts to Beta Function and the final result follows by using Euler's Reflection Formula Γ(z)Γ(1−z)=sinπzπ
Now, all that remains is to split the integral as
∫0∞1+xmxn−1dx=∫011+xmxn−1dx+∫1∞1+xmxn−1dx
The first term evaluates to
∫011+xmxn−1dx=∫01xn−1k=0∑∞(−1)kxmk dx=k=0∑∞mk+n(−1)k
Similarly, the second term can be evaluated by making the following substitution : y=x1
∫1∞1+xmxn−1dx=∫011+ymym−n−1dy=k=0∑∞mk+m−n(−1)k
And thus the result follows. □
Interesting part is that, the base case when m=2,n=1, you get the above mentioned well known series of alternating sum of reciprocal of odd numbers that is
k=0∑∞2k+1(−1)k=4π
And I am sure, that you all must have got some other, perhaps more elegant, proof for the same. So, please do share it with all of us.
#Calculus
#Series
#SummationOfSeries
#SeriesExpansion
#Kishlaya
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
what an amazing beautiful proof
Log in to reply
Thank You So Much.