Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Question:
2018 Fall Final - 10
Author: Michiel Smid
The function $T : \mathbb{N} \rightarrow \mathbb{N}$ is recursively defined as follows: $$ \begin{align} T(0) &= 2, \\ T(n) &= 3 \cdot T(n - 1) + 1,\ \ \mathrm{if}\ n \geq 1. \end{align} $$ Which of the following is true for all integers $n \geq 0$?
(a)
$T(n) = \frac{3}{2} \cdot 3^{n} - \frac{1}{2}$
(b)
None of the above.
(c)
$T(n) = \frac{5}{2} \cdot 3^{n} - 1$
(d)
$T(n) = \frac{5}{2} \cdot 3^{n} - \frac{1}{2}$
COMP 2804: Discrete Structures II
COMP 2804 Final Exam
Recursive Functions (4.1)