2 ⋅ 4 1 + 2 ⋅ 4 ⋅ 6 1 ⋅ 3 + 2 ⋅ 4 ⋅ 6 ⋅ 8 1 ⋅ 3 ⋅ 5 + 2 ⋅ 4 ⋅ 6 ⋅ 8 ⋅ 1 0 1 ⋅ 3 ⋅ 5 ⋅ 7 + … = ?
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.
I didn't know of that identity.
You have got the best solution among the lot. Please tell how you thought of it
Log in to reply
I don't know if this is valid, but are you allowed to partial fraction/split up each fraction.
8 1 = 4 1 − 8 1
1 6 1 = 4 1 − 1 6 3
1 2 8 5 = 1 6 3 − 1 2 8 1 9
2 5 6 7 = 1 2 8 1 9 − 2 5 6 3 1
1 0 2 4 2 1 = 2 5 6 3 1 − 1 0 2 4 1 0 3
2 0 4 8 3 3 = 1 0 2 4 1 0 3 − 2 0 4 8 1 7 3
3 2 7 6 8 4 2 9 = 2 0 4 8 1 7 3 − 3 2 7 6 8 2 3 3 9
Note how everything is of the form 2 n a = 2 p b − 2 n a − b ( 2 n − p ) .
The RHS of the RHS tends 0 farther and farther down the list. Since the n+1 term's LHS of the RHS is the same as n's RHS of the RHS (sorry for my horrid wording), the LHS of the RHS will also tend 0.
So we are left with the first two terms of 4 1 + 4 1 = 2 1
Cool thing to note, the numerator of the second term on theRHSis always a prime.
Log in to reply
Oh my gosh, this is a really neat sequence of primes.
Now I realize that this is due to the goldbach conjecture.
I don't get it, what does the the dot (".") in "2.4.6" mean?
Nope, your identity is wrong
( 1 − x ) − n = 1 + ( 1 n ) x + ( 2 n + 1 ) x 2 + ( 3 n + 2 ) x 3 + . . .
Its general term is given by (which series you have wrote?, moreover keeping 1/2 does'nt give 2.4 in denominator)
T r + 1 = r ! n ( n + 1 ) ( n + 2 ) . . . . . [ n + ( r − 1 ) ] × x r
S = 2 . 4 1 + 2 . 4 . 6 1 . 3 + 2 . 4 . 6 . 8 1 . 3 . 5 + 2 . 4 . 6 . 8 . 1 0 1 . 3 . 5 . 7 + . . . . . ∞
S = 1 . 2 1 ( 2 1 ) 1 + 1 . 2 . 3 2 1 . 2 3 × ( 2 1 ) 2 + 1 . 2 . 3 . 4 2 1 . 2 3 . 2 5 × ( 2 1 ) 3 + . . . . . . .
2 S = 2 ! 1 ( 2 1 ) 2 + 3 ! 2 1 . ( 1 + 2 1 ) × ( 2 1 ) 3 + 4 ! 2 1 . ( 1 + 2 1 ) . ( 2 + 2 1 × ( 2 1 ) 4 + . . . . . . .
2 S = ( 1 − 2 1 ) − 1 / 2 = 2 − 1 − 2 1 = 0 . 4 1 4 − 0 . 5 × 2 = 0 . 8 1 8 − 1 = − 0 . 1 8 2
While writing answer I made many mistakes
Log in to reply
Thanks for the solution.
The identity is right.
From where did you know that identity?????
This is amazing
W e h a v e t h e s u m a s S = lim n → ∞ ∑ r = 1 n 2 . 4 . 6 . . . . . . . ( 2 r + 2 ) 1 . 3 . 5 . . . . . . . . ( 2 r − 1 ) T r = 2 . 4 . 6 . . . . . . . ( 2 r + 2 ) 1 . 3 . 5 . . . . . . . . ( 2 r − 1 ) = 2 . 4 . 6 . . . . . . . ( 2 r + 2 ) 1 . 3 . 5 . . . . . . . . ( 2 r − 1 ) ( 1 ( 2 r + 2 ) − ( 2 r + 1 ) ) ( m u l t i p l y i n g a n d d i v i d i n g b y 1 ) ⇒ T r = 2 . 4 . 6 . . . . . . . . . . . . ( 2 r ) 1 . 3 . 5 . . . . . . . . ( 2 r − 1 ) − 2 . 4 . 6 . . . . . . . ( 2 r + 2 ) 1 . 3 . 5 . . . . . . . . ( 2 r + 1 ) = V r − V r + 1 ⇒ S = ∑ T r = ∑ V r − V r + 1 = V 1 − lim n → ∞ V n = 1 / 2
Excellent! But you need to show that n → ∞ lim V n = 0
By induction, it can be shown that
k = 1 ∑ n 2 k + 1 k ! ( k + 1 ) ! ( 2 k ) ! = 2 1 − 2 n + 1 n ! ( n + 1 ) ! ( 2 n ) ! ( 2 n + 1 )
so that as
n
→
∞
, we end up with
2
1
Use Stirling's approximation to find this limit.
See example below to see how this induction works
2 . 4 1 + 2 . 4 . 6 1 . 3 + 2 . 4 . 6 . 8 1 . 3 . 5 = 2 1 − 2 . 4 . 6 . 8 1 . 3 . 5 7
2 . 4 1 + 2 . 4 . 6 1 . 3 + 2 . 4 . 6 . 8 1 . 3 . 5 + 2 . 4 . 6 . 8 . 1 0 1 . 3 . 5 . 7 = 2 1 − 2 . 4 . 6 . 8 . 1 0 1 . 3 . 5 . 7 9
2 . 4 . 6 . 8 1 . 3 . 5 7 − 2 . 4 . 6 . 8 . 1 0 1 . 3 . 5 . 7 9 = 2 . 4 . 6 . 8 . 1 0 1 . 3 . 5 . 7
You can use Binomial theorem here, ma'am.
Ma'am? Really?
Solution by David Vaccaro clarified
The identity given by David Vaccaro is absolutely right!
S = 2 ⋅ 4 1 x 2 + 2 ⋅ 4 ⋅ 6 1 ⋅ 3 x 3 + 2 ⋅ 4 ⋅ 6 ⋅ 8 1 ⋅ 3 ⋅ 5 x 4 + ⋯ where x = 1
According to Binomial Theorem (general),
( 1 − x ) − q p = 1 + 1 ! p q x + 2 ! p ( p + q ) ( q x ) 2 + 3 ! p ( p + q ) ( p + 2 q ) ( q x ) 3 + ⋯
Putting p = − 1 , q = 2
( 1 − x ) − q p Hence, when ( 1 − 1 ) 2 1 ∴ S = 2 1 = 1 + 1 ! p q x + 2 ! p ( p + q ) ( q x ) 2 + 3 ! p ( p + q ) ( p + 2 q ) ( q x ) 3 + ⋯ = ( 1 − x ) 2 1 = 1 − 1 ! 1 2 x − 2 ! 1 ( − 1 + 2 ) ( 2 x ) 2 − 3 ! 1 ( − 1 + 2 ) ( − 1 + 4 ) ( 2 x ) 3 + ⋯ = 1 − 1 ! 1 2 x − 2 ! 1 ⋅ 1 ( 2 x ) 2 − 3 ! 1 ⋅ 1 ⋅ 3 ( 2 x ) 3 − 4 ! 1 ⋅ 1 ⋅ 3 ⋅ 5 ( 2 x ) 4 + ⋯ = 1 − 2 1 x − 2 ⋅ 4 1 x 2 − 2 ⋅ 4 ⋅ 6 1 ⋅ 3 x 3 − 2 ⋅ 4 ⋅ 6 ⋅ 8 1 ⋅ 3 ⋅ 5 x 4 + ⋯ x = 1 = 0 = 1 − 2 1 − S
Thanks for this wonderful solution, David Vaccaro!!
You have to be careful here. Note that you haven't yet established that the sum converges at x = 1 . You will instead need to prove that it converges to a finite value first.
The binomial theorem is valid for ∣ x ∣ < 1 , and we have to check the case when ∣ x ∣ = 1 carefully. For example, in the expansion of ( 1 + x ) − 1 , we cannot apply x = 1 to conclude that
1 + 1 1 = ( 1 + 1 ) − 1 = 1 − 1 + 1 − 1 + 1 − 1 + …
You have to be careful here. Note that you haven't yet established that the sum converges at x = 1 . You will instead need to prove that it converges to a finite value first.
The binomial theorem is valid for ∣ x ∣ < 1 , and we have to check the case when ∣ x ∣ = 1 carefully. For example, in the expansion of ( 1 + x ) − 1 , we cannot apply x = 1 to conclude that
1 + 1 1 = ( 1 + 1 ) − 1 = 1 − 1 + 1 − 1 + 1 − 1 + …
Log in to reply
I guess, Root test will do that for me @Calvin Lin sir. It gave me some value < 1 if I am not wrong.
Log in to reply
I'm not certain if the root test works. I doubt it does. Each additional term 2 n + 2 2 n − 1 brings you much closer to the value of 1, and so the limit of the root would be 1. This can be formalized better using Stirling's Formula .
Note that the n t h term in the sum can be recognized as 2 n + 1 C n where C n is the nth Catalan number. Thus the sum is 1 / 2 n ≥ 1 ∑ C n ( 1 / 4 ) n = 1 − 1 / 2 = 1 / 2
Problem Loading...
Note Loading...
Set Loading...
Not as stylish as the other solutions but ( 1 − x ) 2 1 = 1 − 2 x − 2 . 4 x 2 − 2 . 4 . 6 1 . 3 . x 3
Put x = 1 gives 0 = 1 − 2 1 − S and S = 2 1 .