You pick cards one at a time without replacement from an ordinary deck of 52 playing cards. what is the minimum number of cards
1 answer:
You might be interested in
(a)
Using the quotient rule:
For maximum, f'(x) = 0;
(b) <em>Deduce:
</em>
<em>
Soln:</em> Since x = e is the greatest value, then f(e) ≥ f(x) > f(0)
Now, since x > 0, then we don't have to worry about flipping the signs when multiplying by x.
Taking the exponential to both sides will cancel with the natural logarithmic function in the right hand side to produce:
Cos(<span>θ) < 0, so we know it would be in Quadrant 2 or 3
then csc(</span>θ) = 257, but csc(θ) =
= 257
==> sin(<span>θ) =
it is positive, so now we can determine that is in Quadrant 2
sin(</span>θ) = opp./hyp both of opp and hyp are positive but adj suppose to negative because that way it leads the cos(<span>θ) < 0
</span>cos(<span>θ) = adj/hyp
</span>Pythereom to find the adj:
cosθ =
tanθ =
cos<span>θ = </span>
then csc(</span>θ) = 257, but csc(θ) =
==> sin(<span>θ) =
it is positive, so now we can determine that is in Quadrant 2
sin(</span>θ) = opp./hyp both of opp and hyp are positive but adj suppose to negative because that way it leads the cos(<span>θ) < 0
</span>cos(<span>θ) = adj/hyp
</span>Pythereom to find the adj:
cosθ =
tanθ =
cos<span>θ = </span>