Answer: A
I used my graphic calculator
Answer:
g(1) = -65; g(n) = g(n-1) -15
Step-by-step explanation:
Using n = 1, 2, 3, we can find the first three terms of the sequence:
g(1) = -50 -15 = -65
g(2) = -50 -15(2) = -80
g(3) = -50 -15(3) = -95
The first term of the arithmetic sequence is -65, so that is g(1). Each next term is 15 less than the one before, so the recursive formula is ...
g(n) = g(n-1) -15
The complete recursive function definition requires both parts:
g(1) = -65
g(n) = g(n-1) -15
Answer:
Therefore Mason would be expected to win 50 times.
Step-by-step explanation:
i) probability of flipping a head for a fair coin is 
ii) probability of flipping two fair coins is = 
iii) Therefore if Mason plays 200 times he would be expected to win
= 
25% of 150 = 37.5
700% of x = 37.5
x = 5.35714285
