Final answer:
To determine f(5), we apply the recursive formula f(n) = 2f(n-1), starting from the initial condition f(1) = 8, and find that f(5) is 128.
Step-by-step explanation:
To find the value of f(5), we will use the given function f(n) = 2f(n-1) and the initial condition f(1) = 8.
We can calculate the values step by step for f(2), f(3), f(4), and finally f(5).
- f(2) = 2f(2-1) = 2f(1) = 2×8 = 16
- f(3) = 2f(3-1) = 2f(2) = 2×16 = 32
- f(4) = 2f(4-1) = 2f(3) = 2×32 = 64
- f(5) = 2f(5-1) = 2f(4) = 2×64 = 128
Therefore, the value of f(5) is 128.