11.2: Recurrence Relations
a sequence \(\{a_k\}\) from a set \(A\text{,}\) where \(a_0,a_1,\ldots ,a_{K-1}\) are defined explicitly, and for \(k\ge K\text{,}\) the term \(a_k\) is defined in terms of some (or all) of the previous terms in the sequence \(a_0, \, a_1, \, \ldots , \, a_{k-1}\)
for a recursively-defined sequence, the formula that defines the general term \(a_k\) recursively in the previous terms \(a_0, \, a_1, \, \ldots , \, a_{k-1}\)
A ball is dropped from a height of 100 cm. On each bounce, it returns to \(75\%\) of its previous height.
Let \(h_k\) be the height in centimetres after the \(k^{th}\) bounce. Then \(h_0 = 100\) and the recurrence relation is
\begin{align*} h_k & = \dfrac{3h_{k-1}}{4} \text{,} & k & \ge 1 \text{.} \end{align*}
The terms of the sequence are
\begin{equation*} 100, \, 75, \, 56.25, \, 42.1875, \, \ldots \text{.} \end{equation*}
Set \(a_0 = 1\text{,}\) and let \(a_k = k a_{k-1}\) for \(k \ge 1\text{.}\) Then the terms of the sequence are
\begin{equation*} 1, \, 1, \, 2, \, 6, \, 24, \, 120, \, \ldots \text{.} \end{equation*}
The sequence
\begin{equation*} 0, \, 1, \, 1, \, 2, \, 3, \, 5, \, 8, \, 13, \, 21, \, 34, \ldots \end{equation*}
can be defined recursively by \(a_0 = 0\text{,}\) \(a_1 = 1\text{,}\) and
\begin{align*} a_k & = a_{k-1} + a_{k-2} \text{,} & k & \ge 2 \text{.} \end{align*}
Define a sequence \(\{A_k\}\) from \(\mathscr{P}(\mathbb{N})\) recursively as follows. Let \(A_0 = \emptyset\text{,}\) and take the recurrence relation to be
\begin{align*} A_k & = A_{k-1} \cup \{k\} \text{,} & k & \ge 1 \text{.} \end{align*}
Then the terms of the sequence are
\begin{equation*} \emptyset, \, \{1\}, \, \{1,2\}, \, \{1,2,3\}, \, \ldots , \, \{1, 2, \ldots , k \}, \, \ldots \text{.} \end{equation*}