If $$\sum\limits_{r = 0}^{2n} {{a_r}{{\left( {x - 2} \right)}^r}\,\, = \sum\limits_{r = 0}^{2n} {{b_r}{{\left( {x - 3} \right)}^r}} } $$ and $${a_k} = 1$$ for all $$k \ge n,$$ then show that $${b_n} = {}^{2n + 1}{C_{n + 1}}$$

Using induction or otherwise, prove that for any non-negative integers $$m$$, $$n$$, $$r$$ and $$k$$ ,
$$\sum\limits_{m = 0}^k {\left( {n - m} \right)} {{\left( {r + m} \right)!} \over {m!}} = {{\left( {r + k + 1} \right)!} \over {k!}}\left[ {{n \over {r + 1}} - {k \over {r + 2}}} \right]$$

Prove that $${{{n^7}} \over 7} + {{{n^5}} \over 5} + {{2{n^3}} \over 3} - {n \over {105}}$$ is an integer for every positive integer $$n$$

Prove that
$${C_0} - {2^2}{C_1} + {3^2}{C_2}\,\, - \,..... + {\left( { - 1} \right)^n}{\left( {n + 1} \right)^2}{C_n} = 0,\,\,\,\,n > 2,\,\,$$ where $${C_r} = {}^n{C_r}.$$