$${S_n} = \sum\limits_{r = 0}^n {{1 \over {{}^n{C_r}}}}$$

=$${1 \over {{}^n{C_0}}} + {1 \over {{}^n{C_1}}} + .... + {1 \over {{}^n{C_n}}}$$

$${t_n} = \sum\limits_{r = 0}^n {{r \over {{}^n{C_r}}}}$$

= $${0 \over {{}^n{C_0}}} + {1 \over {{}^n{C_1}}} + {2 \over {{}^n{C_2}}}.... + {n \over {{}^n{C_n}}}$$.........(1)

We can write $${t_n}$$ by rearranging like this,

$${t_n}$$ = $${n \over {{}^n{C_n}}} + {{n - 1} \over {{}^n{C_{n - 1}}}} + ... + {1 \over {{}^n{C_1}}} + {0 \over {{}^n{C_0}}}$$

= $${n \over {{}^n{C_0}}} + {{n - 1} \over {{}^n{C_1}}} + ... + {1 \over {{}^n{C_{n - 1}}}} + {0 \over {{}^n{C_n}}}$$.........(2)

[as $${{}^n{C_0}}$$ = $${{}^n{C_n}}$$, $${{}^n{C_1}}$$ = $${{}^n{C_{n - 1}}}$$......]

By adding (1) and (2) we get,

$$2{t_n}$$ = $${n \over {{}^n{C_0}}} + {n \over {{}^n{C_1}}} + ... + {n \over {{}^n{C_{n - 1}}}} + {n \over {{}^n{C_n}}}$$

= $$n\left[ {{1 \over {{}^n{C_0}}} + {1 \over {{}^n{C_1}}} + ... + {1 \over {{}^n{C_{n - 1}}}} + {1 \over {{}^n{C_n}}}} \right]$$

= n$${S_n}$$

$$\therefore$$ $${{{t_n}} \over {{S_n}}} = {n \over 2}$$

Given $$\left( {1 + x} \right){\left( {1 - x} \right)^n}$$

= $${\left( {1 - x} \right)^n}$$ + $$x{\left( {1 - x} \right)^n}$$

General term of $${\left( {1 - x} \right)^n}$$ = $${}^n{C_r}.{\left( { - 1} \right)^r}.{x^r}$$

$$\therefore$$ Term containing $${x^n}$$ in $${\left( {1 - x} \right)^n}$$ = $${}^n{C_n}.{\left( { - 1} \right)^n}.{x^n}$$

So coefficient of $${x^n}$$ in $${\left( {1 - x} \right)^n}$$ = $${}^n{C_n}.{\left( { - 1} \right)^n}$$

General term of $$x{\left( {1 - x} \right)^n}$$ = $${}^n{C_r}.{\left( { - 1} \right)^r}.{x^{r + 1}}$$

$$\therefore$$ Term containing $${x^n}$$ in $$x{\left( {1 - x} \right)^n}$$ = $${}^n{C_{n - 1}}.{\left( { - 1} \right)^{n - 1}}.{x^n}$$

So coefficient of $${x^n}$$ in $$x{\left( {1 - x} \right)^n}$$ = $${}^n{C_{n - 1}}.{\left( { - 1} \right)^{n - 1}}$$

$$\therefore$$ coefficient of $${x^n}$$ in $${\left( {1 - x} \right)^n}$$ + $$x{\left( {1 - x} \right)^n}$$

= $${}^n{C_n}.{\left( { - 1} \right)^n}$$ + $${}^n{C_{n - 1}}.{\left( { - 1} \right)^{n - 1}}$$

= $${\left( { - 1} \right)^{n - 1}}\left[ {{}^n{C_{n - 1}} - {}^n{C_n}} \right]$$

= $${\left( { - 1} \right)^{n - 1}}\left[ {n - 1} \right]$$

= $${\left( { - 1} \right)^n}\left[ {1 - n} \right]$$

For $${\left( {1 + \alpha x} \right)^4}$$ the middle term $${T_{{4 \over 2} + 1}}$$ = $${}^4{C_2}.{\alpha ^2}{x^2}$$

$$\therefore$$ Coefficient of middle term = $${}^4{C_2}.{\alpha ^2}$$

For $${\left( {1 - \alpha x} \right)^6}$$ the middle term $${T_{{6 \over 2} + 1}}$$ = $${}^6{C_3}.-{\alpha ^3}{x^3}$$

$$\therefore$$ Coefficient of middle term = $${}^6{C_3}.{-\alpha ^3}$$

$$\therefore$$ According to question,

$${}^4{C_2}.{\alpha ^2}$$ = $${}^6{C_3}.{-\alpha ^3}$$

$$ \Rightarrow 6 = 20 \times - \alpha $$

$$ \Rightarrow \alpha = - {3 \over {10}}$$

Given $$S(K)$$ $$ = 1 + 3 + 5... + \left( {2K - 1} \right) = 3 + {K^2}$$

When k = 1, S(1): 1 = 3 + 1,

L.H.S of S(k) $$ \ne $$ R.H.S of S(k)

So S(1) is not true.

As S(1) is not true so principle of mathematical induction can not be used.

S(K+1) = 1 + 3 + 5... + (2K - 1) + (2K + 1) = 3 + (k + 1)²

Now let S(k) is true

$$\therefore$$ 1 + 3 + 5 +........(2k - 1) = 3 + k²

$$ \Rightarrow $$ 1 + 3 + 5 +........(2k - 1) + (2k + 1) = 3 + k² + 2k +1

= 3 + (k + 1)²

$$ \Rightarrow $$ S(k + 1) is true.

$$\therefore$$ S(k) $$ \Rightarrow $$ S(k + 1)