n = 1 ∑ ∞ 2 n n 5
Let the value of the above summation be A . What is the value of A + 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.
Nice solution! Wish I could learn these stuffs.
Log in to reply
Read Euler the master of us all by Will Dunham it will walk you thru a lot of these series tricks used by the master himself.
did the same!
Wonderful answer
You were ask to answer using an expression with respect to A, not the actual numerical value.
We all know that n = 1 ∑ ∞ x n = 1 − x x for ∣ x ∣ < 1 .
So, d x d ( n = 1 ∑ ∞ x n ) = n = 1 ∑ ∞ d x d ( x n ) = n = 1 ∑ ∞ n x n − 1 = d x d ( 1 − x x ) ⇒ n = 1 ∑ ∞ n x n = x d x d ( 1 − x x )
If this process is done 5 times, we get: n = 1 ∑ ∞ n 5 x n = x d x d ( x d x d ( x d x d ( x d x d ( x d x d ( 1 − x x ) ) ) ) )
So for x = 2 1 , n = 1 ∑ ∞ 2 n n 5 = [ x d x d ( x d x d ( x d x d ( x d x d ( x d x d ( 1 − x x ) ) ) ) ) ] x = 2 1
After some calculation, you get n = 1 ∑ ∞ 2 n n 5 = [ ( x − 1 ) 6 x ( x 4 + 2 6 x 3 + 6 6 x 2 + 2 6 x + 1 ) ] x = 2 1 = 1 0 8 2 and finally 1 0 8 2 + 7 = 3 3
The solution below is not written by me , i just share it from another forum which i asked.
Apparently it uses something called Poyla form.
The solver is the forum user Hoempa , and this is the link
As n = 1 ∑ ∞ 2 n ( k n ) = 2
and n 5 = 1 2 0 ( 5 n ) + 2 4 0 ( 4 n ) + 1 5 0 ( 3 n ) + 3 0 ( 2 n ) + 1 ( 1 n ) , ∑ n = 1 ∞ 2 n n 5 = 2 ( 1 2 0 + 2 4 0 + 1 5 0 + 3 0 + 1 ) = 1 0 8 2
therefore A + 7 = 1 0 8 9 = 3 3
I posted here only after i obtained permission from the solver. I hope i credit it enough to not being called plagiariser.
Lastly , i don't understand this solution , never learn Poyla before. Please don't ask me anything significant. Just sharing for maybe.......the enlightment of some other user?
Wow! I had never heard of the word Polya before . Thanks for increasing my vocab! :P
Nice solution :D
Let S = i = 1 ∑ ∞ 2 i i 5 .
Thus, S = 2 1 1 5 + 2 2 2 5 + 2 3 3 5 + … + 2 n n 5 + …
Then, multiplying it by 2 gives us: 2 S = 2 0 1 5 + 2 1 2 5 + 2 2 3 5 + … + 2 n ( n + 1 ) 5 + …
Thus, we can write: 2 S − S = 1 + 2 1 2 5 − 1 5 + … + 2 n ( n + 1 ) 5 − n 5 + …
So: S = 1 + 5 i = 1 ∑ ∞ 2 i i 4 + 1 0 i = 1 ∑ ∞ 2 i i 3 + 1 0 i = 1 ∑ ∞ 2 i i 2 + 5 i = 1 ∑ ∞ 2 i i + i = 1 ∑ ∞ 2 i 1
I will calculate this by parts.
First, let S 1 = i = 1 ∑ ∞ 2 i 1 ; this is a geometric series with first term equal to 2 1 and ratio 2 1 ; thus, its value equals 1 − 2 1 2 1 = 1 .
Now, let S 2 = i = 1 ∑ ∞ 2 i i . We can write:
S 2 = 2 1 1 + 2 2 2 + 2 3 3 + … + 2 n n + …
Multiplying it by two yields:
2 S 2 = 1 + 2 1 2 + 2 2 3 + 2 3 4 + … + 2 n ( n + 1 ) + …
Thus: 2 S 2 − S 2 = 1 + 2 1 1 + 2 2 1 + 2 3 1 + … + 2 n 1 + … .
From this we derive: S 2 = 1 + S 1 = 1 + 1 = 2 .
Thirdly, let S 3 = i = 1 ∑ ∞ 2 i i 2 . We can write:
S 3 = 2 1 1 2 + 2 2 2 2 + 2 3 3 2 + … + 2 n n 2 + …
Multiplying it by two yields:
2 S 3 = 1 + 2 1 2 2 + 2 2 3 2 + 2 3 4 2 + … + 2 n ( n + 1 ) 2 + …
Thus: 2 S 3 − S 3 = 1 + 2 1 3 + 2 2 5 + 2 3 7 + … + 2 n ( 2 n + 1 ) + … .
From this we derive: S 2 = 1 + 2 ∗ S 2 + S 1 = 1 + 4 + 1 = 6
Now, for S 4 = 2 1 1 3 + 2 2 2 3 + 2 3 3 3 + … + 2 n n 3 + …
Using a similar procedure we arrive at: S 4 = 1 + 3 S 3 + 3 S 2 + S 1 = 1 + 3 ∗ 6 + 3 ∗ 2 + 1 = 2 6
Finally, for S 5 = 2 1 1 4 + 2 2 2 4 + 2 3 3 4 + … + 2 n n 4 + … , we have:
S 5 = 1 + 4 S 4 + 6 S 3 + 4 S 2 + S 1 =
1 + 4 ∗ 2 6 + 6 ∗ 6 + 4 ∗ 2 + 1 = 1 + 1 0 4 + 3 6 + 8 + 1 = 1 5 0 .
Thus: S = 1 + 5 S 5 + 1 0 S 4 + 1 0 S 3 + 5 S 2 + 1 =
1 + 5 ∗ 1 5 0 + 1 0 ∗ 2 6 + 1 0 ∗ 6 + 5 ∗ 2 + 1 = 1 2 + 7 5 0 + 2 6 0 + 6 0 = 1 0 8 2
Thus, A = 1 0 8 2 , and so A + 7 = 1 0 8 9 = 3 3 .
I loved how Pascal Triangle fits inside! +1
Instead of calculating it every time, you could use induction and get a recurrence of the form S n + 2 = ∑ r = 0 n ( r n ) S r + 1 . Prove it just as you proved it above five times and then just calculate them stepwise.
Nice and simplified solution...
For − 1 < x < 1 , we have:
n = 0 ∑ ∞ x n n = 1 ∑ ∞ n x n − 1 n = 1 ∑ ∞ n x n n = 1 ∑ ∞ n 2 x n − 1 n = 1 ∑ ∞ n 2 x n n = 1 ∑ ∞ n 3 x n − 1 n = 1 ∑ ∞ n 3 x n n = 1 ∑ ∞ n 4 x n − 1 n = 1 ∑ ∞ n 4 x n n = 1 ∑ ∞ n 5 x n − 1 n = 1 ∑ ∞ n 5 x n n = 1 ∑ ∞ 2 n n 5 = 1 − x 1 = ( 1 − x ) 2 1 = ( 1 − x ) 2 x = ( 1 − x ) 3 1 + x = ( 1 − x ) 3 x ( 1 + x ) = ( 1 − x ) 4 1 + 4 x + x 2 = ( 1 − x ) 4 x + 4 x 2 + x 3 = ( 1 − x ) 5 1 + 1 1 x + 1 1 x 2 + x 3 = ( 1 − x ) 5 x + 1 1 x 2 + 1 1 x 3 + x 4 = ( 1 − x ) 6 1 + 2 6 x + 6 6 x 2 + 2 6 x 3 + x 4 = ( 1 − x ) 6 x + 2 6 x 2 + 6 6 x 3 + 2 6 x 4 + x 5 = ( 1 − 2 1 ) 6 2 1 + 2 2 2 6 + 2 3 6 6 + 2 4 2 6 + 2 5 1 = 2 + 2 6 ( 4 ) + 6 6 ( 8 ) + 2 6 ( 1 6 ) + 3 2 = 1 0 8 2 Differentiate both sides Multiply both sides by x Differentiate again × x again Differentiate again × x again Differentiate again × x again Differentiate again × x again Put x = 2 1
⟹ A + 7 = 1 0 8 2 + 7 = 3 3 .
For me I used differentiation. Just requires a lot of patience...
Problem Loading...
Note Loading...
Set Loading...
we have i = 1 ∑ ∞ 2 i i 5 = i = 0 ∑ ∞ 2 i + 1 ( i + 1 ) 5 = 2 1 i = 0 ∑ ∞ 2 i ( i + 1 ) 5
now by using the binomial expand for ( i + 1 ) 5 = i 5 + 5 i 4 + 1 0 i 3 + 1 0 i 2 + 5 i + 1
So i = 1 ∑ ∞ 2 i i 5 = 2 1 ( i = 0 ∑ ∞ 2 i i 5 + 5 i = 0 ∑ ∞ 2 i i 4 + 1 0 i = 0 ∑ ∞ 2 i i 3 + 1 0 i = 0 ∑ ∞ 2 i i 2 + 5 i = 0 ∑ ∞ 2 i i + i = 0 ∑ ∞ 2 i 1 )
But i = 0 ∑ ∞ 2 i 1 = 1 + i = 1 ∑ ∞ ( 2 1 ) i = 1 − 2 1 2 1 = 2 1 2 1 = 2 & i = 0 ∑ ∞ 2 i i = 0 + i = 1 ∑ ∞ 2 i i = 2
since i = 1 ∑ ∞ 2 i i = i = 0 ∑ ∞ 2 i + 1 i + 1 = 2 1 ( i = 0 ∑ ∞ 2 i i + i = 0 ∑ ∞ 2 i 1 ) = 2 1 ( i = 1 ∑ ∞ 2 i i + 2 ) ⇒ ( 1 − 2 1 ) i = 1 ∑ ∞ 2 i i = 1 ⇒ i = 1 ∑ ∞ 2 i i = 2
Thus i = 1 ∑ ∞ 2 i i 2 = 2 1 ( i = 1 ∑ ∞ 2 i i 2 + 4 + 2 ) = 2 1 i = 1 ∑ ∞ 2 i i 2 + 3 ⇒ ( 1 − 2 1 ) i = 1 ∑ ∞ 2 i i 2 = 3 ⇔ i = 1 ∑ ∞ 2 i i 2 = 6
Same work we will work for i = 0 ∑ ∞ 2 i i 3 & i = 0 ∑ ∞ 2 i i 4
i = 0 ∑ ∞ 2 i i 3 = 0 + i = 1 ∑ ∞ 2 i i 3 = i = 0 ∑ ∞ 2 i + 1 ( i + 1 ) 3 = 2 1 ( i = 0 ∑ ∞ 2 i i 3 + 3 i = 0 ∑ ∞ 2 i i 2 + 3 i = 0 ∑ ∞ 2 i i + i = 0 ∑ ∞ 2 i 1 )
= 2 1 ( i = 1 ∑ ∞ 2 i i 3 + 3 ( 6 ) + 3 ( 2 ) + 2 ) ⇒ i = 1 ∑ ∞ 2 i i 3 = 2 1 i = 1 ∑ ∞ 2 i i 3 + 1 3 ⇒ i = 0 ∑ ∞ 2 i i 3 = 2 6
Similarly we expand i = 0 ∑ ∞ 2 i i 4 = 0 + i = 1 ∑ ∞ 2 i i 4 = i = 0 ∑ ∞ 2 i + 1 ( i + 1 ) 4 = 2 1 i = 0 ∑ ∞ 2 i ( i + 1 ) 4
⇒ i = 0 ∑ ∞ 2 i i 4 = 2 1 ( i = 0 ∑ ∞ 2 i i 4 + 4 i = 0 ∑ ∞ 2 i i 3 + 6 i = 0 ∑ ∞ 2 i i 2 + 4 i = 0 ∑ ∞ 2 i i + i = 0 ∑ ∞ 2 i 1 )
= 2 1 i = 0 ∑ ∞ 2 i i 4 + 2 1 ( 4 ( 2 6 ) + 6 ( 6 ) + 4 ( 2 ) + 2 ) ⇒ i = 0 ∑ ∞ 2 i i 4 = 2 1 i = 0 ∑ ∞ 2 i i 4 + 7 5 ⇔ i = 0 ∑ ∞ 2 i i 4 = 1 5 0
Thus i = 1 ∑ ∞ 2 i i 5 = 2 1 i = 0 ∑ ∞ 2 i i 5 + 2 1 ( 5 ( 1 5 0 ) + 1 0 ( 2 6 ) + 1 0 ( 6 ) + 5 ( 2 ) + 2 ) thus i = 1 ∑ ∞ 2 i i 5 = 1 0 8 2 hence A + 7 = 1 0 8 2 + 7 = 1 0 8 9 = 3 3 2 = 3 3