Prove that
$${2^k}\left( {\matrix{ n \cr 0 \cr } } \right)\left( {\matrix{ n \cr k \cr } } \right) - {2^{^{k - 1}\left( {\matrix{ n \cr 2 \cr } } \right)}}\left( {\matrix{ n \cr 1 \cr } } \right)\left( {\matrix{ {n - 1} \cr {k - 1} \cr } } \right)$$
$$ + {2^{k - 2}}\left( {\matrix{ {n - 2} \cr {k - 2} \cr } } \right) - .....{\left( { - 1} \right)^k}\left( {\matrix{ n \cr k \cr } } \right)\left( {\matrix{ {n - k} \cr 0 \cr } } \right) = {\left( {\matrix{ n \cr k \cr } } \right)^ \cdot }$$

Use mathematical induction to show that
$${\left( {25} \right)^{n + 1}} - 24n + 5735$$ is divisible by $${\left( {24} \right)^2}$$ for all $$ = n = 1,2,...$$

A coin probability $$p$$ of showing head when tossed. It is tossed $$n$$ times. Let $${p_n}$$ denote the probability that no two (or more) consecutive heads occur. Prove that $${p_1} = 1,\,\,{p_2} = 1 - {p^2}$$ and $${p_n} = \left( {1 - p} \right).\,\,{p_{n - 1}} + p\left( {1 - p} \right){p_{n - 2}}$$ for all $$n \ge 3.$$

Prove by induction on, that $${p_n} = A{\alpha ^n} + B{\beta ^n}$$ for all $$n \ge 1,$$ where $$\alpha $$ and $$\beta $$ are the roots of quadratic equation $${x^2} - \left( {1 - p} \right)x - p\left( {1 - p} \right) = 0$$ and $$A = {{{p^2} + \beta - 1} \over {\alpha \beta - {\alpha ^2}}},B = {{{p^2} + \alpha - 1} \over {\alpha \beta - {\beta ^2}}}.$$

Let $$a,\,b,\,c$$ be possitive real numbers such that $${b^2} - 4ac > 0$$ and let $${\alpha _1} = c.$$ Prove by induction that $${\alpha _{n + 1}} = {{a\alpha _n^2} \over {\left( {{b^2} - 2a\left( {{\alpha _1} + {\alpha _2} + ... + {\alpha _n}} \right)} \right)}}$$ is well-defined and
$${\alpha _{n + 1}} < {{{\alpha _n}} \over 2}$$ for all $$n = 1,2,....$$ (Here, 'well-defined' means that the denominator in the expression for $${\alpha _{n + 1}}$$ is not zero.)