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$$

Using mathematical induction, prove that $${}^m{C_0}{}^n{C_k} + {}^m{C_1}{}^n{C_{k - 1}}\,\,\, + .....{}^m{C_k}{}^n{C_0} = {}^{\left( {m + n} \right)}{C_k},$$
where $$m,\,n,\,k$$ are positive integers, and $${}^p{C_q} = 0$$ for $$p < q.$$