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.
Using the binomial series, show that the sequence given by \(u_n=n\,\) has generating function \(x(1-x)^{-2}\), and find the sequence that has generating function \(x(1-x)^{-3}\).
Hence, or otherwise, find the generating function for the sequence \(u_n =n^2\). You should simplify your answer.
\(\bf (a)\) The sequence \(u_0\), \(u_1\), \(u_2\), \(\ldots\,\) is determined by
\(u_{n} = ku_{n-1}\) (\(n\ge1\)), where \(k\) is independent of \(n\),
and \(u_0=a\). By summing the identity \(u_{n}x^n \equiv ku_{n-1}x^n\), or otherwise, show that the generating function, f, satisfies
\[ \f(x) = a + kx \f(x) \]
Write down an expression for \(\f(x)\).
\(\bf (b)\) The sequence \(u_0, u_1, u_2, \ldots\,\) is determined by \(u_{n} = u_{n-1}+ u_{n-2}\) (\(n\ge2\)) and \(u_0=0\), \(u_1=1\).
Obtain the generating function.
Show that
$\ds
^{2r} \! {\rm C}_r =\frac{1\times3\times\dots\times (2r-1)}{r!} \, \times 2^r
\;,
$
for \(r\ge1\,\).
Give the first four terms of the binomial series for
\(\l 1 - p \r^{-\frac12}\).
By choosing a suitable value for \(p\) in this series, or otherwise, show that
$$
\displaystyle \sum_{r=0}^\infty \frac{ {\vphantom {\A}}^{2r} \! {\rm C}_r }{ 8^r} = \sqrt 2
\;
.$$
[{\bf Note: }
$
{\vphantom{A}}^n {\rm C}_r
$
is an alternative notation for
$\ds \
\binom n r
\,
\( for \)r\ge1\,\(, and \)
{\vphantom{A}}^0 {\rm C}_0 =1
$ .]