3 problems found
By considering the expansions in powers of \(x\) of both sides of the identity $$ {(1+x)^n}{(1+x)^n}\equiv{(1+x)^{2n}}, $$ show that $$ \sum_{s=0}^n {n\choose s}^2 = {2n\choose n}, $$ where \(\displaystyle {n\choose s}= \frac{n!}{s!\,(n-s)!}\). By considering similar identities, or otherwise, show also that:
Solution: To obtain the coefficient of \(x^n\) on the RHS we clearly have \(\displaystyle \binom{2n}n\). To obtain the coefficient of \(x^n\) on the LHS we can obtain \(x^s\) from the first bracket and \(x^{n-s}\) from the second bracket, ie \(\displaystyle \sum_{s=0}^n \binom{n}{s}\binom{n}{n-s} = \sum_{s=0}^n \binom{n}{s}\binom{n}{s} = \sum_{s=0}^n \binom{n}{s}^2\)
By considering the coefficient of \(x^{n}\) in the identity \((1-x)^{n}(1+x)^{n}=(1-x^{2})^{n},\) or otherwise, simplify \[ \binom{n}{0}^{2}-\binom{n}{1}^{2}+\binom{n}{2}^{2}-\binom{n}{3}^{2}+\cdots+(-1)^{n}\binom{n}{n}^{2} \] in the cases (i) when \(n\) is even, (ii) when \(n\) is odd.
Solution: The coefficient of \(x^n\) on the LHS is \begin{align*} && (1-x^2)^n &= (1-x)^n(1+x)^n \\ [x^n]: && \begin{cases} (-1)^{\lfloor \frac{n}2 \rfloor}\binom{n}{\lfloor \frac{n}2 \rfloor} &\text{if } n\text{ even} \\ 0 & \text{otherwise} \end{cases} &= \sum_{i=0}^n \underbrace{(-1)^i\binom{n}{i}}_{\text{take }(-x)^i\text{ from first bracket}} \cdot \underbrace{\binom{n}{n-i}}_{\text{take }x^{n-i}\text{ from second bracket}} \\ &&&= \sum_{i=0}^n (-1)^i\binom{n}{i}\binom{n}{i} \\ &&&= \sum_{i=0}^n (-1)^i\binom{n}{i}^2\\ \end{align*}
The function \(\mathrm{f}\) is given by \(\mathrm{f}(x)=\sin^{-1}x\) for \(-1 < x < 1.\) Prove that \[ (1-x^{2})\mathrm{f}''(x)-x\mathrm{f}'(x)=0. \] Prove also that \[ (1-x^{2})\mathrm{f}^{(n+2)}(x)-(2n+1)x\mathrm{f}^{(n+1)}(x)-n^{2}\mathrm{f}^{(n)}(x)=0, \] for all \(n>0\), where \(\mathrm{f}^{(n)}\) denotes the \(n\)th derivative of \(\mathrm{f}\). Hence express \(\mathrm{f}(x)\) as a Maclaurin series. The function \(\mathrm{g}\) is given by \[ \mathrm{g}(x)=\ln\sqrt{\frac{1+x}{1-x}}, \] for \(-1 < x < 1.\) Write down a power series expression for \(\mathrm{g}(x),\) and show that the coefficient of \(x^{2n+1}\) is greater than that in the expansion of \(\mathrm{f},\) for each \(n > 0\).