Problems

Filters
Clear Filters

2 problems found

2004 Paper 1 Q7
D: 1500.0 B: 1500.0
generalised binomial theorem recurrence relation power series partial fractions generating function geometric series linear recurrence

  1. The function \(\f(x)\) is defined for \(\vert x \vert < \frac15\) by \[ \f(x) = \sum_{n=0}^\infty a_n x^n\;, \] where \(a_0=2\), \(a_1=7\) and \(a_n =7a_{n-1} - 10a_{n-2}\) for \(n\ge{2}\,\). Simplify \(\f(x) - 7x\f(x) + 10x^2\f(x)\,\), and hence show that \(\displaystyle\f(x) = {1\over 1-2x} + {1 \over 1-5x} \;\). Hence show that \(a_n=2^n + 5^n\,\).
  2. The function \(\g(x)\) is defined for \(\vert x \vert < \frac13\) by \[ \g(x) = \sum_{n=0}^\infty b_n x^n \;, \] where \(b_0=5\,\), \(b_1 =10 \,\), \(b_2=40\,\), \(b_3=100\) and \(b_n = pb_{n-1} + qb_{n-2}\) for \(n\ge{2}\,\). Obtain an expression for \(\g(x)\) as the sum of two algebraic fractions and determine \(b_n\) in terms of \(n\).

Solution:

  1. \begin{align*} && f(x) -7xf(x)+10x^2f(x) &= \sum_{n=0}^\infty a_n x^n - 7x \sum_{n=0}^{\infty} a_n x^n + 10x^2 \sum_{n=0}^{\infty} a_nx^n \\ &&&= \sum_{n=2}^\infty (a_n-7a_{n-1}+10a_{n-2})x^n + a_0+a_1x-7a_0x \\ &&&= 0 + 2-7x \\ \\ \Rightarrow && f(x) &= \frac{2-7x}{1-7x+10x^2} \\ &&&= \frac{2-7x}{(1-5x)(1-2x)} \\ &&&= \frac{1}{1-2x} + \frac{1}{1-5x} \\ &&&= \sum_{n=0}^{\infty} (2^n + 5^n)x^n \end{align*} Therefore \(a_n = 2^n +5^n\)
  2. \(\,\) \begin{align*} && 40 &= 10p + 5 q \\ && 100 &= 40p+10q \\ && 10 &= 4p + q \\ \Rightarrow && (p,q) &= (1,6) \\ \\ && g(x) -xg(x)-6x^2g(x) &= 5+5x \\ \Rightarrow && g(x) &= \frac{5+5x}{1-x-6x^2} \\ &&&= \frac{5+5x}{(1-3x)(1+2x)} \\ &&&= \frac{4}{1-3x} + \frac{1}{1+2x} \\ &&&= \sum_{n=0}^{\infty} (4 \cdot 3^n + (-2)^n)x^n \\ \Rightarrow && b_n &= 4 \cdot 3^n + (-2)^n \end{align*}

View
1988 Paper 1 Q5
D: 1500.0 B: 1487.0
generalised binomial theorem partial fractions geometric series power series generating function convergence interval algebraic identity

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} )\)

View