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:
It has a maximum
Step-by-step explanation:
The way I think about it is looking at "a" (the leading variable's coefficient, so __x²), if it's negative, the graph is a frown, but if it's positive, it's a smile. In this case, a is -2, so the graph would have the shape of a frown, which has a maximum.
I hope this helped!
No. he used 50% on the rides, and we have to convert the fraction to a percent by dividing 4&1 which equals 0.25, then we multiply that by 100 to get the percentage he used on video games which equals 25%. 50+25= 75% used tickets for both rides and video games. So then we subtract 75 from 100 and get 25% which means he used 25% of the tickets on batting cages. Your answer is no, he used 25% of his tickets on the batting cages.
A is 1/8 and b is 5/8, hope this helps!
Answer:
she got back 63 times
Step-by-step explanation:
Here, we want to know the number of times she is at bat
from the question, we are made to know that she strikes out twice after 9 times
So striking out 14 times, the number of times she has got back will be ;
14/2 * 9 = 63 times
