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.)

Let $$n$$ be any positive integer. Prove that $$$\sum\limits_{k = 0}^m {{{\left( {\matrix{ {2n - k} \cr k \cr } } \right)} \over {\left( {\matrix{ {2n - k} \cr n \cr } } \right)}}.{{\left( {2n - 4k + 1} \right)} \over {\left( {2n - 2k + 1} \right)}}{2^{n - 2k}} = {{\left( {\matrix{ n \cr m \cr } } \right)} \over {\left( {\matrix{ {2n - 2m} \cr {n - m} \cr } } \right)}}{2^{n - 2m}}} $$$

for each non-be gatuve integer $$m \le n.$$ $$\,\left( {Here\left( {\matrix{ p \cr q \cr } } \right) = {}^p{C_q}} \right).$$

Let $$p$$ be a prime and $$m$$ a positive integer. By mathematical induction on $$m$$, or otherwise, prove that whenever $$r$$ is an integer such that $$p$$ does not divide $$r$$, $$p$$ divides $${}^{np}{C_r},$$

[Hint: You may use the fact that $${\left( {1 + x} \right)^{\left( {m + 1} \right)p}} = {\left( {1 + x} \right)^p}{\left( {1 + x} \right)^{mp}}$$]

Let $$0 < {A_i} < n$$ for $$i = 1,\,2....,\,n.$$ Use mathematical induction to prove that $$$\sin {A_1} + \sin {A_2}....... + \sin {A_n} \le n\,\sin \,\,\left( {{{{A_1} + {A_2} + ...... + {A_n}} \over n}} \right)$$$

where $$ \ge 1$$ is a natural number. {You may use the fact that $$p\sin x + \left( {1 - p} \right)\sin y \le \sin \left[ {px + \left( {1 - p} \right)y} \right],$$ where $$0 \le p \le 1$$ and $$0 \le x,y \le \pi .$$}