Take a table and determine the explicit and recursive functions for it.
1
3
f(n)
1
3
9
Recursive: f(n) = f(n-1) * 3, f(1) = 1
Explicit: f(n) = 3n-1
In this example, the letter n is our variable that represents our input. In this
example, f(n) represents our output.
n
2
n
4
27
4
12
5
81
5
15
6
243
6
18
7
729
1
2
3.
f(n)
3
6
9
Recursive: f(n) = f(n-1) + 3, f(1) = 3
Explicit: f(n) = 3n
In this example, the letter n is our variable that represents our input. In this
example, f(n) represents our output.
7
21
