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.
∑ n = 0 ∞ 2 n n ! ( n + 2 ) ! = ∑ n = 0 ∞ 2 n − 1 1 ( 2 n + 2 )
with some help form Pascal's formula, which says
( k + 1 n + 1 ) = ( k + 1 n ) + ( k n )
∑ n = 0 ∞ 2 n − 1 1 ( 2 n + 2 ) = ∑ n = 0 ∞ 2 n − 1 1 ( ( 2 n + 1 ) + ( 1 n + 1 ) )
∑ n = 0 ∞ 2 n − 1 1 ( ( 2 n + 1 ) + ( 1 n + 1 ) ) = ∑ n = 0 ∞ 2 n − 1 1 ( ( 2 n + 1 ) ) + ∑ n = 0 ∞ ( 2 n − 1 n + 1 )
Generating functions can be utilised, if the above summations are written as below.
f ( x ) = ∑ n = 0 ∞ 2 n − 1 1 ( 2 n + 2 ) x n = ∑ n = 0 ∞ 2 n − 1 1 ( 2 n + 1 ) x n + ∑ n = 0 ∞ 2 n − 1 n + 1 x n
can be further simplified as
f ( x ) = 2 1 f ( x ) + 4 + x d x d ( 2 − x 1 ) + 2 − x 3
the rest is a simple derivative calculation and solving for f ( x ) . Finally evaluate f ( x ) for x = 1 .
Problem Loading...
Note Loading...
Set Loading...
S S 2 S 2 S 4 S 4 S = n = 0 ∑ ∞ 2 n n ! ( n + 2 ) ! = n = 0 ∑ ∞ 2 n ( n + 1 ) ( n + 2 ) = 2 0 2 + 2 1 6 + 2 2 1 2 + 2 3 2 0 + ⋯ + 2 n ( n + 1 ) ( n + 2 ) + ⋯ = 2 1 2 + 2 2 6 + 2 3 1 2 + 2 4 2 0 + ⋯ + 2 n n ( n + 1 ) + ⋯ = 2 0 2 + 2 1 4 + 2 2 6 + 2 3 8 + ⋯ + 2 n 2 ( n + 1 ) + ⋯ = 2 1 2 + 2 2 4 + 2 3 6 + 2 4 8 + ⋯ + 2 n 2 n + ⋯ = 2 0 2 + 2 1 2 + 2 2 2 + 2 3 2 + ⋯ + 2 n 2 + ⋯ = 2 + 2 0 1 + 2 1 1 + 2 2 1 + ⋯ = 2 + 1 − 2 1 1 = 4 . . . ( 1 ) . . . 2 ( 1 ) → ( 2 ) . . . ( 1 ) − ( 2 ) → ( 3 ) . . . 2 ( 3 ) → ( 4 ) . . . ( 3 ) − ( 4 ) → ( 5 ) Infinite geometric progression
Therefore S = 1 6