Answer:
13/-3
Step-by-step explanation:
Y2-Y1/X2-X1
A. C(13, 10) = 13! = 13·12·11 = 13 · 2 · 11 = 286.C(13, 10) = 13! = 13·12·11 = 13 · 2 · 11 = 286.
B. P(13,10)= 13! =13! =13·12·11·10·9·8·7·6·5·4.
(13−10)! 3!
C. f there is exactly one woman chosen, this is possible in C(10, 9)C(3, 1) =
10! 3!
9!1! 1!2!
10! 3!
8!2! 2!1!
10! 3!
7!3! 3!0!
= 10 · 3 = 30 ways; two women chosen — in C(10,8)C(3,2) =
= 45·3 = 135 ways; three women chosen — in C(10, 7)C(3, 3) =
= 10·9·8 ·1 = 120 ways. Altogether there are 30+135+120 = 285
1·2·3
<span>possible choices.</span><span>
</span>
We'd have to simply divide the total amount of hours by the total amount of episodes. This would be 10.5 / 14 = 0.75
So now, let's check if this is correct by multiplying 0.75 * 14 which should give us 10.5.
So the answer would be: 0.75 hours per episode.
Step-by-step answer:
The domain of log functions (any legitimate base) requires that the argument evaluates to a positive real number.
For example, the domain of log(4x) will remain positive when x>0.
The domain of log_4(x+3) requires that x+3 >0, i.e. x>-3.
Finally, the domain of log_2(x-3) is such that x-3>0, or x>3.
