Problems

Filters
Clear Filters

2 problems found

2008 Paper 2 Q2
D: 1600.0 B: 1498.5

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

1997 Paper 1 Q3
D: 1484.0 B: 1501.4

Let \(a_{1}=3\), \(a_{n+1}=a_{n}^{3}\) for \(n\geqslant 1\). (Thus \(a_{2}=3^{3}\), \(a_{3}=(3^{3})^{3}\) and so on.)

  1. What digit appears in the unit place of \(a_{7}\)?
  2. Show that \(a_{7}\geqslant 10^{100}\).
  3. What is \(\dfrac{a_{7}+1}{2a_{7}}\) correct to two places of decimals? Justify your answer.


Solution:

  1. Notice that \(a_n = 3^{3^{n-1}}\) in particular, \(a_7 = 3^{3^6}\). Using Fermat's little theorem, we can see that \(3^4 \equiv 1 \pmod{5}\) and so we need to figure out \(3^6 \pmod{4}\), which is clearly \(1\). Therefore \(3^{3^6} \equiv 3^{4k+1} \equiv 3 \pmod{5}\). Therefore the units digit is \(3\).
  2. Notice that \(3^5 > 100\) and \(3^3 > 10\). Therefore \begin{align*} a_7 &= 3^{3^6} \\ &= (3^3)^{3^5} \\ &> 10^{3^5} \\ &> 10^{100} \end{align*}
  3. \begin{align*} \frac{a_7+1}{2a_7} &= \frac12 + \frac1{2a_7} \\ &= 0.5 + 0.\underbrace{000\cdots}_{\text{at least }99\text{ zeros}} \\ &= 0.50 \end{align*} Since \(a_7 > 10^{100}, \, \frac{1}{2a_7} < 10^{-100}\)