QB6
20 marks
Sequences and Series
Functional Equations and Identities via Series
View
Define $f _ { k } ( n )$ to be the sum of all possible products of $k$ distinct integers chosen from the set $\{ 1,2 , \ldots , n \}$, i.e., $$f _ { k } ( n ) = \sum _ { 1 \leq i _ { 1 } < i _ { 2 } < \ldots < i _ { k } \leq n } i _ { 1 } i _ { 2 } \ldots i _ { k }$$ a) For $k > 1$, write a recursive formula for the function $f _ { k }$, i.e., a formula for $f _ { k } ( n )$ in terms of $f _ { \ell } ( m )$, where $\ell < k$ or ($\ell = k$ and $m < n$). b) Show that $f _ { k } ( n )$, as a function of $n$, is a polynomial of degree $2k$. c) Express $f _ { 2 } ( n )$ as a polynomial in variable $n$.