Which recursive formula can be used to generate the sequence below, where f(1) = 6 and n ≥ 1? 6, 1, –4, –9, –14, … f (n 1) = f(n
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
Another complex expression, let's simplify it step by step...
We'll start by re-writing 256 as 4^4
Then we'll extract the 4 from the cubic root. We will then subtract 3 from the exponent (4) to get to a simple 4 inside, and a 4 outside.
Now, we have x^10, so if we divide the exponent by the root factor, we get 10/3 = 3 1/3, which means we will extract x^9 that will become x^3 outside and x will remain inside.
For the y's we have y^7 inside the cubic root, that means the true exponent is y^(7/3)... so we can extract y^2 and 1 y will remain inside.
The answer is then: