2 ⎝ ⎛ 1 + n = 1 ∑ ∞ 2 n ( 2 n + 1 ) n ! ( 2 n − 1 ) ! ! ⎠ ⎞ = 2 n = 0 ∑ ∞ ( n − 1 / 2 ) 2 n + 1 ( − 1 ) n = ? Note: 2 n n ! = ( 2 n ) ! ! .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
In this proof we are using generalised binomial theorem. We need to justify so many things. If a sequence of functions fn(x) converges uniformly to f(x) in [0,1]. Then integral of limit of fn(x)=limit of integral. Here the limits of integral are from 0 to 1. We have a function (1-x^2)^(-0.5). This can be expanded in power series for -1<x<1. If r<1 then Integral of this function from 0 to r is equal to sum of the integrals of each term of the power series. This we are able to do as the power series converges uniformly in [0,r]. This integral is clearly sininverse(r) we get a series for sininverse of r. We know that that the limit of sininverse(r) exists as r tends to 1- and equals pi/2. We claim that pi/2 is equal to the series we get by substituting r=1. This we can do because of this elementary result. If we have a sequence such that all for each n an is greater than or equal to 0 and a0+a1x+a2x^2+...... converges to the limit A as x tends to 1 from left. Then a0+a1+a2......... converges to A. This is mathematics. We need to justify everything. Life is not easy.
Log in to reply
There are many things which need to be justified in case of infinite series. Example we know that l 1/ (1+x) has a power series expansion for x in (-1,1). The power series converges uniformly in the the interval (-r,r)if r in (0,1). We can calculate ln(2)using this. Here we need to use Abel limit theorem.
Consider the sum
S = n = 1 ∑ ∞ 2 n ( 2 n + 1 ) n ! ( 2 n − 1 ) ! ! = n = 1 ∑ ∞ 2 2 n ( 2 n + 1 ) ( n ! ) 2 ( 2 n ) ! = n = 1 ∑ ∞ ( n 2 n ) 2 2 n ( 2 n + 1 ) 1 Note that ( 2 n − 1 ) ! ! = 2 n n ! ( 2 n ) ! and ( n 2 n ) = ( n ! ) 2 ( 2 n ) !
Using the generating function of central binomial coefficient,
n = 0 ∑ ∞ ( n 2 n ) x n n = 0 ∑ ∞ ( n 2 n ) x 2 n n = 0 ∑ ∞ ( n 2 n ) 2 n + 1 x 2 n + 1 n = 0 ∑ ∞ ( n 2 n ) 2 n + 1 x 2 n n = 0 ∑ ∞ ( n 2 n ) 2 2 n ( 2 n + 1 ) 1 n = 1 ∑ ∞ ( n 2 n ) 2 2 n ( 2 n + 1 ) 1 = 1 − 4 x 1 = 1 − 4 x 2 1 = 2 1 sin − 1 ( 2 x ) + C = 2 1 sin − 1 ( 2 x ) = 2 x sin − 1 ( 2 x ) = 1 sin − 1 1 = 2 π = 2 π − 1 Replace x with x 2 Integrate both sides w.r.t. x . where C is the constant of integration. Since L H S = 0 when x = 0 ⟹ C = 0 Divide both sides by x . Put x = 2 1
Therefore, 2 ( 1 + S ) = 2 ( 1 + 2 π − 1 ) = π ≈ 3 . 1 4 2 .
I understand it
Problem Loading...
Note Loading...
Set Loading...
Using basic convergence results for power series and the generalized binomial theorem , we have 2 n = 0 ∑ ∞ ( n − 1 / 2 ) 2 n + 1 ( − 1 ) n = 2 ∫ 0 1 ( n = 0 ∑ ∞ ( n − 1 / 2 ) ( − 1 ) n x 2 n ) d x = 2 ∫ 0 1 ( n = 0 ∑ ∞ ( n − 1 / 2 ) ( − x 2 ) n ) d x = 2 ∫ 0 1 ( 1 − x 2 ) − 1 / 2 d x = 2 ∫ 0 π / 2 ( 1 − sin 2 θ ) − 1 / 2 ⋅ cos θ d θ = 2 ∫ 0 π / 2 d θ = 2 ⋅ 2 π = π ≈ 3 . 1 4 1 5 9