For this case we have the following recursive formula:
[tex]f (n + 1) = f (n) - 2
[/tex]
What we must do in this case is to evaluate different values of n until we find f (5)
We have then:
For n = 1:
[tex]f (1 + 1) = f (1) - 2
f (2) = f (1) - 2
f (2) = 18 - 2
f (2) = 16[/tex]
For n = 2:
[tex]f (2 + 1) = f (2) - 2
f (3) = f (2) - 2
f (3) = 16 - 2
f (3) = 14[/tex]
For n = 3:
[tex]f (3 + 1) = f (3) - 2
f (4) = f (3) - 2
f (4) = 14 - 2
f (4) = 12[/tex]
For n = 4:
[tex]f (4 + 1) = f (4) - 2
f (5) = f (4) - 2
f (5) = 12 - 2
f (5) = 10[/tex]
Answer:
The value of the recursive formula for f (5) is given by:
[tex]f (5) = 10[/tex]
