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
Okay. First thngs first, let's divide each of them. 2.6/1.3 is 2. Now in terms of exponents, we would just simply subtract the powers, because we are doing division. 9 - 2 is 7. The value of the expression is 2 * 10^7. Even writing the problem out in number form (2,600,000,000/130), you can still see the answer to the problem as 20 million. The answer is B.
Answer:
We cannot agree with Andre because x = 3.
Step-by-step explanation:
Assuming the diagram is a weighing scale which can also be represented as an equation having two sides that is balanced. We can express the situation as follows using equation:
x + 2 = 5
Solve for x
x + 2 - 2 = 5 - 2 (subtraction property of equality)
x = 3
If you plug in the value of x on the diagram given, the scale becomes balance on each side.
Therefore, x = 3. Andre is wrong and we cannot agree with Andre.
