Answer:
75
Step-by-step explanation:
f(1) = 7
f(n) = 3f(n-1) + 3
So what you are trying to do here is find the recursive value (that's what it is called) for f(n). Computers love this sort of thing, but we humans have to do it slowly and carefully.
So let's try f(2)
That means that f(2) = 3*f(n-1) + 3
but if f(2) is used it means that you have to know f(2-1) which is just f(1) and we know that.
so f(2) = 3*f(1)+3
f(2) = 3*7 + 3
f(2) = 21 + 3
f(2) = 24
Now do it again. We now know F(2), so we should be able to find f(3)
f(3) = 3*f(3 - 1) + 3
f(3) = 3*f(2) + 3 We know that f(2) = 24
f(3) = 3* 24 + 3
f(3) = 72 + 3
f(3) = 75
Answer:
The answer to your question is the first option
Step-by-step explanation:
64
Process
1.- Find the prime factors of 64
64 2
32 2
16 2
8 2
4 2
2 2
1
64 = 2⁶
2.- Express 64 as a fractional exponent
64
3.- Simplify
64
64
64![^{1/4} = 2\sqrt[4]{2^{2}}](https://tex.z-dn.net/?f=%5E%7B1%2F4%7D%20%3D%202%5Csqrt%5B4%5D%7B2%5E%7B2%7D%7D)
4.- Result
64
Answer: finding slope (-4, 1), (1,-2) : m= -3/5
Answer:
7 is the answer. If a number can be divided by 36 then it can also be divided by 12 which is 3*12 therefor the remainder will be 19-12 which is 7. When 19 is divided by 36, the remainder is 19 and so 19 must be a number. When 19 is divided by 12 the remainder is 7.
Step-by-step explanation:
The function's input value is 2.
f(x) = 2x² + 3x + 5
f(x) = 2(2)² + 3(2) + 5
f(x) = 2(4) + 6 + 5
f(x) = 8 + 11
f(x) = 19