Let be the combinatorial summation as described above for integers and . Generalize in terms of and . Then using a calculator, evaluate the value of .
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.
Let A n = k ∑ ( 2 k n ) ( m k ) , then
n = 0 ∑ ∞ A n x n = = = = = = = = n = 0 ∑ ∞ ( k ∑ ( 2 k n ) ( m k ) ) x n k = 0 ∑ ∞ ( n ∑ ( 2 k n ) x n ) k = 0 ∑ ∞ ( m k ) ( 1 − x ) 2 k + 1 x 2 k 1 − x 1 k = 0 ∑ ∞ ( m k ) ( ( 1 − x ) 2 x 2 ) k 1 − x 1 [ ( ( 1 − x ) 2 x 2 ) m ÷ ( 1 − ( 1 − x ) 2 x 2 ) m + 1 ] ( 1 − x ) ( 1 − 2 x ) m + 1 x 2 m ( 1 − x ) ( 2 x ) m ( 1 − 2 x ) m + 1 ( 2 x ) m ( 1 − x ) ( 2 x ) m r = m ∑ ∞ ( m r ) ( 2 x ) r
By comparing the coefficients of x n we get that
A n = = = 2 m 1 [ ( m n − m ) 2 n − m − ( m n − m − 1 ) 2 n − m − 1 ] 2 n − 2 m − 1 [ 2 ( m n − m ) − n − m n − 2 m ( m n − m ) ] 2 n − 2 m − 1 n − m n ( m n − m )
In this case, n = 4 0 and m = 1 5 . The result follows.