Exercise 1.4.23* (Conundrum 5/8)

Show that

k = 0 ( k + n k ) 2 k = 2 n + 1 .

Show that

k = 0 n ( k + n k ) 2 k = 2 n .

Answers

beginproof

(a)
By Exercise 7, for | z | < 1 , 1 ( 1 z ) n + 1 = k = 0 k + n k z k .

If we take z = 1 2 in this formula, we obtain

k = 0 k + n k 2 k = 1 ( 1 ( 1 2 ) ) n + 1 = 2 n + 1 .

(b)
Induction is the key! We search a relation between S n and S n + 1 , where S n = k = 0 n k + n k 2 k = k = 0 n k + n n 2 k ,

and

S n + 1 = k = 0 n + 1 k + n + 1 n + 1 2 k .

Using the Pascal relation

k + n n + k + n n + 1 = k + n + 1 n + 1 ,

we obtain

S n = 1 + k = 1 n k + n n 2 k = 1 + k = 1 n ( k + n + 1 n + 1 k + n n + 1 ) 2 k = 1 + k = 1 n k + n + 1 n + 1 2 k k = 1 n k + n n + 1 2 k = 1 + k = 1 n k + n + 1 n + 1 2 k K = 0 n 1 K + n + 1 n + 1 2 K 1 ( K = k 1 ) = 1 + k = 1 n k + n + 1 n + 1 2 k k = 0 n k + n + 1 n + 1 2 k 1 + 2 n + 1 n + 1 2 n 1 = 1 2 + k = 1 n k + n + 1 n + 1 ( 2 k 2 k 1 ) + 2 n + 1 n + 1 2 n 1 = 1 2 ( 1 + k = 1 n k + n + 1 n + 1 2 k + 2 n + 1 n + 1 2 n ) = 1 2 ( k = 0 n k + n + 1 n + 1 2 k + 2 2 n + 1 n + 1 2 n 1 ) = 1 2 ( k = 0 n k + n + 1 n + 1 2 k + 2 n + 2 n + 1 2 n 1 ) = 1 2 k = 0 n + 1 k + n + 1 n + 1 2 k = 1 2 S n + 1 , because 2 n + 2 n + 1 = ( 2 n + 2 ) ! ( n + 1 ) ! ( n + 1 ) ! = 2 n + 2 n + 1 ( 2 n + 1 ) ! ( n + 1 ) ! n ! = 2 2 n + 1 n + 1 .

So S n + 1 = 2 S n for all n , and S 0 = 1 . Therefore S n = 2 n . That is

k = 0 n k + n k 2 k = 2 n .

User profile picture
2024-07-30 08:17
Comments