Exercise 1.4.20* (Conundrum 2/8)

Show that if m and n are integers with 0 m < n , then

k = m + 1 n ( 1 ) k ( n k ) ( k 1 m ) = ( 1 ) m + 1 .

Answers

Same auxiliary function in Exercise 20 and 21.

Proof. Consider the function f defined on by

f ( x ) = { 1 ( 1 x ) n x if  x 0 , n if  x = 0 .

Despite appearances, f is a polynomial function, because, for x 0 ,

f ( x ) = 1 ( 1 x ) n 1 ( 1 x ) = 1 + ( 1 x ) + ( 1 x ) 2 + + ( 1 x ) n 1 ,

and f ( 0 ) = n = 1 + ( 1 0 ) + ( 1 0 ) 2 + + ( 1 0 ) n 1 .

Moreover, if x 0 ,

f ( x ) = 1 x ( 1 k = 0 n ( 1 ) k ( n k ) x k ) = k = 1 n ( 1 ) k + 1 ( n k ) x k 1 ,

and this equality remains true if x = 0 . Therefore, for all x ,

f ( x ) = 1 + ( 1 x ) + ( 1 x ) 2 + + ( 1 x ) n 1 = k = 1 n ( 1 ) k + 1 ( n k ) x k 1 .

We compute the m -th derivative of f , in two ways, and in particular f ( m ) ( 1 ) m ! .

If u j ( x ) = x j , then u ( i ) ( x ) = j ! ( j i ) ! x j i if i j , and u j ( k ) ( x ) = 0 if i > j .

If v j ( x ) = ( 1 x ) j , then v j ( i ) ( x ) = ( 1 ) i j ! ( j i ) ! ( 1 x ) j i , and v j ( i ) ( x ) = 0 if i > j .

Therefore, using the second expression of f ( x ) , for m < n ,

f ( m ) ( x ) = k = m + 1 n ( 1 ) k ( n k ) ( k 1 ) ! ( k 1 m ) ! x k 1 m ,

thus

f ( m ) ( 1 ) m ! = k = m + 1 n ( 1 ) k ( n k ) ( k 1 m ) .

Using the first expression of f ( x ) ,

f m ( x ) = ( 1 ) m ( m ! 0 ! + ( 1 x ) m ! 1 ! + + m ! n 1 m ) ! ( 1 x ) n 1 m ) ,

thus

f ( m ) ( 1 ) m ! = ( 1 ) m .

The comparison gives

k = m + 1 n ( 1 ) k ( n k ) ( k 1 m ) = ( 1 ) m + 1 .

User profile picture
2024-07-29 07:38
Comments