17 problems found
In this question, you need not consider issues of convergence.
Solution:
Given an infinite sequence of numbers \(u_0\), \(u_1\), \(u_2\), \(\ldots\,\), we define the generating function, \(\f\), for the sequence by \[ \f(x) = u_0 + u_1x +u_2 x^2 +u_3 x^3 + \cdots \,. \] Issues of convergence can be ignored in this question.
Solution:
Use the binomial expansion to show that the coefficient of \(x^r\) in the expansion of \((1-x)^{-3}\) is \(\frac12 (r+1)(r+2)\,\).
Solution: Notice that the coefficient of \(x^r\) is \((-1)^r\frac{(-3) \cdot (-3-1) \cdots (-3-r+1)}{r!} = (-1)^r \frac{(-1)(-2)(-3)(-4) \cdots (-(r+2))}{(-1)(-2)r!} = (-1)^r(-1)^{r+2}\frac{(r+2)!}{2r!} = \frac{(r+2)(r+1)}2\).
Solution:
Let \(a_n\) be the coefficient of \(x^n\) in the series expansion, in ascending powers of \(x\), of \[\displaystyle \frac{1+x}{(1-x)^2(1+x^2)} \,, \] where \(\vert x \vert <1\,\). Show, using partial fractions, that either \(a_n =n+1\) or \(a_n = n+2\) according to the value of \(n\). Hence find a decimal approximation, to nine significant figures, for the fraction \( \displaystyle \frac{11\,000}{8181}\). \newline [You are not required to justify the accuracy of your approximation.]
Solution: \begin{align*} && \frac{1+x}{(1-x)^2(1+x^2)} &= \frac{A}{1-x} + \frac{B}{(1-x)^2} + \frac{Cx+D}{1+x^2} \\ \Rightarrow && 1 + x &= A(1-x)(1+x^2) + B(1+x^2) + Cx(1-x)^2 + D(1-x)^2 \\ \Rightarrow && 2 &= 2B \tag{\(x = 1\)} \\ \Rightarrow && 1 &= B \\ \Rightarrow && 1 &= A+B+D \tag{\(x = 0\)}\\ \Rightarrow && A &= -D \\ \Rightarrow && 0 &= 4A+2B-4C+4D \tag{\(x = -1\)}\\ \Rightarrow && C &= \frac12\\ \Rightarrow && 3 &= -5A+5B+2C+D \tag{\(x=2\)} \\ \Rightarrow && 3 &= -6A+6 \\ \Rightarrow && A,D &=-\frac12,\frac12 \\ \Rightarrow && \frac{1+x}{(1-x)^2(1+x^2)} &= \frac{1}{(1-x)^2} +\frac{1}{2(1-x)}+ \frac{x-1}{2(1+x^2)} \\ &&&=\sum_{k=0}^{\infty}(k+1)x^k + \sum_{k=0}^{\infty}\frac12 x^k + \sum_{k=0}^{\infty}\frac12 (-1)^kx^{2k+1} - \sum_{k=0}^{\infty}\frac12 (-1)^kx^{2k} \end{align*} Therefore the coefficient of \(x^n\) is \(n+1\) or \(n+2\) depending on whether the coefficients from the final series add constructively \(n \equiv 1, 2 \pmod{4}\) or destructively. \begin{align*} \frac{11\, 000}{8181} &= \frac{(10+1) \cdot 1000}{(10-1)^2 \cdot (100+1)} \\ &= \frac{(1+\frac{1}{10})}{(1-\frac{1}{10})^2 \cdot (1+\frac1{10})} \\ &= 1 + \frac3{10} + \frac4{10^2} + \frac{4}{10^3}+\frac{5}{10^4} + \frac{7}{10^5} + \frac{8}{10^6} + \cdots \\ & \quad \quad \cdots + \frac{8}{10^7} + \frac{9}{10^8} + \frac{11}{10^9} + \frac{12}{10^{10}} + \cdots \\ &= 1.34457890 + \frac{12}{10^{10}} + \cdots \end{align*} \begin{align*} && \sum_{k=m}^{\infty} (k+2)x^k &= x^m \sum_{k=0}^{\infty} (k+m+2)x^{k} \\ && &= \frac{x^k}{(1-x)^2} + \frac{(m+2)x^k}{1-x} \\ \Rightarrow && |\sum_{k=m}^{\infty} a_k \left ( \frac1{10} \right )^k | &\leq \frac{1}{10^m}\left ( \frac{1}{(1-\frac1{10})^2} + \frac{m+2}{1-\frac1{10}} \right) \\ &&&= \frac{1}{10^{m-1}} \left ( \frac{9m+28}{81}\right ) \end{align*} Therefore for this will be less than \(10^{-9}\), when \(m = 11\), so our approximation is valid to 9sf
Solution:
Solution:
Solution:
Solution:
Solution:
Sum the following infinite series.
Solution:
The matrix \(\mathbf{F}\) is defined by \[ \mathbf{F}=\mathbf{I}+\sum_{n=1}^{\infty}\frac{1}{n!}t^{n}\mathbf{A}^{n}, \] where $\mathbf{A}=\begin{pmatrix}-3 & -1\\ 8 & 3 \end{pmatrix} \( and \) t \( is a variable scalar. Evaluate \)\mathbf{A}^{2}$, and show that \[ \mathbf{F}=\mathbf{I}\cosh t+\mathbf{A}\sinh t. \] Show also that \(\mathbf{F}^{-1}=\mathbf{I}\cosh t-\mathbf{A}\sinh t\), and that \(\dfrac{\mathrm{d}\mathbf{F}}{\mathrm{d}t}=\mathbf{FA}\). The vector $\mathbf{r}=\begin{pmatrix}x(t)\\ y(t) \end{pmatrix}$ satisfies the differential equation \[ \frac{\mathrm{d}\mathbf{r}}{\mathrm{d}t}+\mathbf{A}\mathbf{r}=\mathbf{0}, \] with \(x=\alpha\) and \(y=\beta\) at \(t=0.\) Solve this equation by means of a suitable matrix integrating factor, and hence show that \begin{alignat*}{1} x(t) & =\alpha\cosh t+(3\alpha+\beta)\sinh t\\ y(t) & =\beta\cosh t-(8\alpha+3\beta)\sinh t. \end{alignat*}
Solution: \begin{align*} \begin{pmatrix} -3 & -1 \\ 8 & 3 \end{pmatrix}^2 &= \begin{pmatrix} 9-8 & 3-3 \\ -24+24 & -8+9 \end{pmatrix} \\ &= \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \\ &= \mathbf{I} \end{align*} Therefore: \begin{align*} \mathbf{F} &= \mathbf{I}+\sum_{n=1}^{\infty}\frac{1}{n!}t^{n}\mathbf{A}^{n} \\ &= \mathbf{I} + \sum_{n=1}^{\infty} \frac{1}{(2n)!}t^{2n} \mathbf{I} + \sum_{n=0}^{\infty} \frac{1}{(2n+1)!}t^{2n+1} \mathbf{A} \\ &= \cosh t \mathbf{I} + \sinh t \mathbf{A} \end{align*} Notice that \begin{align*} \mathbf{F} (\mathbf{I}\cosh t-\mathbf{A}\sinh t) &= (\mathbf{I}\cosh t+\mathbf{A}\sinh t)(\mathbf{I}\cosh t-\mathbf{A}\sinh t) \\ &= \mathbf{I}^2 \cosh^2 t+\mathbf{A}(\sinh t \cosh t - \cosh t \sinh t) - \mathbf{A}^2\sinh^2 t \\ &= \mathbf{I} \cosh^2 t - \mathbf{I} \sinh^2 t \\ &= \mathbf{I} \end{align*} Therefore \(\mathbf{F}^{-1} = \mathbf{I}\cosh t-\mathbf{A}\sinh t\) \begin{align*} \frac{\d \mathbf{F}}{\d t} &= \frac{\d }{\d t} \left [ \mathbf{I}+\sum_{n=1}^{\infty}\frac{1}{n!}t^{n}\mathbf{A}^{n}\right] \\ &= \sum_{n=1}^{\infty} \frac{1}{(n-1)!}t^{n-1} \mathbf{A}^n \\ &= \left ( \sum_{n=1}^{\infty} \frac{1}{(n-1)!}t^{n-1} \mathbf{A}^{n-1} \right) \mathbf{A} \\ &= \mathbf{F}\mathbf{A} \end{align*} \begin{align*} && \frac{\mathrm{d}\mathbf{r}}{\mathrm{d}t}+\mathbf{A}\mathbf{r}&=\mathbf{0} \\ \Rightarrow && \mathbf{F} \frac{\d \mathbf{r}}{\d t} + \mathbf{FAr} &= \mathbf{0} \\ && \frac{\d }{\d t} \left ( \mathbf{F} \mathbf{r}\right) &= 0 \\ \Rightarrow && \mathbf{Fr} &= \mathbf{c} \\ \Rightarrow && \mathbf{r} &= \mathbf{F}^{-1}\mathbf{c} \\ &&&= ( \mathbf{I}\cosh t-\mathbf{A}\sinh t)\mathbf{c} \\ t = 0: && \binom{\alpha}{\beta} &= \mathbf{c} \\ \Rightarrow && \mathbf{r} &= ( \mathbf{I}\cosh t-\mathbf{A}\sinh t)\binom{\alpha}{\beta} \\ &&&= \binom{\alpha \cosh t}{\beta \cosh t} - \binom{-3\alpha-\beta}{8\alpha + 3\beta}\sinh t \\ &&&= \binom{\alpha \cosh t + (3\alpha + \beta) \sinh t}{\beta \cosh t -(8\alpha + 3\beta)\sinh t} \end{align*} as required
Obtain the sum to infinity of each of the following series.
Solution:
Given that \(b>a>0\), find, by using the binomial theorem, coefficients \(c_{m}\) (\(m=0,1,2,\ldots\)) such that \[ \frac{1}{\left(1-ax\right)\left(1-bx\right)}=c_{0}+c_{1}x+c_{2}x^{2}+\ldots+c_{m}x^{m}+\cdots \] for \(b\left|x\right|<1\). Show that \[ c_{m}^{2}=\frac{a^{2m+2}-2(ab)^{m+1}+b^{2m+2}}{(a-b)^{2}}\,. \] Hence, or otherwise, show that \[ c_{0}^{2}+c_{1}^{2}x+c_{2}^{2}x^{2}+\cdots+c_{m}^{2}x^{m}+\cdots=\frac{1+abx}{\left(1-abx\right)\left(1-a^{2}x\right)\left(1-b^{2}x\right)}\,, \] for \(x\) in a suitable interval which you should determine.
Solution: \begin{align*} \frac{1}{(1-ax)(1-bx)} &=\frac{1}{b-a} \l \frac{b}{1-bx}-\frac{a}{1-ax}\r \\ &= \frac{1}{b-a} \l \sum_{k=0}^{\infty} b(bx)^k-\sum_{k=0}^{\infty} a(ax)^k \r \\ &= \frac{1}{b-a} \sum_{k=0}^{\infty} \l b^{k+1} - a^{k+1} \r x^k \end{align*} Therefore \(\displaystyle c_m = \frac{b^{k+1}-a^{k+1}}{b-a}\). \begin{align*} c_m^2 &= \frac{(b^{m+1}-a^{m+1})^2}{(b-a)^2} \\ &= \frac{a^{2m+2} - 2(ab)^{m+1} + b^{2m+2}}{(b-a)^2} \end{align*} \begin{align*} \sum_{m=0}^{\infty} c_m x^m &= \sum_{m=0}^{\infty} \l \frac{a^{2m+2} - 2(ab)^{m+1} + b^{2m+2}}{(b-a)^2} \r x^m \\ &= \frac{1}{(b-a)^2} \l \sum_{m=0}^{\infty} a^{2m+2} x^m-2\sum_{m=0}^{\infty} (ab)^{m+1} x^m+\sum_{m=0}^{\infty} b^{2m+2} x^m \r \\ &= \frac{1}{(b-a)^2} \l a^2\sum_{m=0}^{\infty} a^{2m} x^m-2ab\sum_{m=0}^{\infty} (ab)^{m} x^m+b^2\sum_{m=0}^{\infty} b^{2m} x^m \r \\ &= \frac{1}{(b-a)^2} \l \frac{a^2}{1-a^2x^2} - \frac{2ab}{1-abx} + \frac{b^2}{1-b^2x^2}\r \\ &= \frac{1+ab}{(1-a^2x)(1-abx)(1-b^2x)} \end{align*} Where geometric series will converge if \(|a^2x| < 1, |b^2x| < 1, |abx| < 1\), ie \(|x| < \min (\frac{1}{a^2}, \frac{1}{b^2} )\)