Answer:
i can't see clearly
Step-by-step explanation:
Answer:
5 11/13km
Step-by-step explanation:
4 ( 1 6/13)
4× 19/13
= 5 11/13
F(x) = 4x - 1
All you have to do is substitute the values in the domain for x in the function.
f(-1) = 4(-1) - 1
f(-1) = -4 - 1
f(-1) = -5
f(0) = 4(0) - 1
f(0) = -1
f(1) = 4(1) - 1
f(1) = 4 - 1
f(1) = 3
And so on.
Answer:
0%
Step-by-step explanation:
Don't quote me on that but I'm pretty sure
Answer:
(a) E(X) = -2p² + 2p + 2; d²/dp² E(X) at p = 1/2 is less than 0
(b) 6p⁴ - 12p³ + 3p² + 3p + 3; d²/dp² E(X) at p = 1/2 is less than 0
Step-by-step explanation:
(a) when i = 2, the expected number of played games will be:
E(X) = 2[p² + (1-p)²] + 3[2p² (1-p) + 2p(1-p)²] = 2[p²+1-2p+p²] + 3[2p²-2p³+2p(1-2p+p²)] = 2[2p²-2p+1] + 3[2p² - 2p³+2p-4p²+2p³] = 4p²-4p+2-6p²+6p = -2p²+2p+2.
If p = 1/2, then:
d²/dp² E(X) = d/dp (-4p + 2) = -4 which is less than 0. Therefore, the E(X) is maximized.
(b) when i = 3;
E(X) = 3[p³ + (1-p)³] + 4[3p³(1-p) + 3p(1-p)³] + 5[6p³(1-p)² + 6p²(1-p)³]
Simplification and rearrangement lead to:
E(X) = 6p⁴-12p³+3p²+3p+3
if p = 1/2, then:
d²/dp² E(X) at p = 1/2 = d/dp (24p³-36p²+6p+3) = 72p²-72p+6 = 72(1/2)² - 72(1/2) +6 = 18 - 36 +8 = -10
Therefore, E(X) is maximized.
