If $${a_n} = \sum\limits_{r = 0}^n {{1 \over {{}^n{C_r}}},\,\,\,then\,\,\,\sum\limits_{r = 0}^n {{r \over {{}^n{C_r}}}} } $$ equals

An n-digit number is a positive number with exactly digits. Nine hundred distinct n-digit numbers are to be formed using only the three digits 2, 5 and 7. The smallest value of n for which this is possible is

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 $$n$$ be an odd integer. If $$\sin n\theta = \sum\limits_{r = 0}^n {{b_r}{{\sin }^r}\theta ,} $$ for every value of $$\theta ,$$ then