8. (a) (i) Using the substitution $t = \tan \frac{\theta}{2}$, or otherwise, show that
\[ \cot \theta + 2 \tan \frac{\theta}{2} = \frac{1}{2} \cot \frac{\theta}{2} - HSC - SSCE Mathematics Extension 2 - Question 8 - 2009 - Paper 1
Question 8
8. (a) (i) Using the substitution $t = \tan \frac{\theta}{2}$, or otherwise, show that
\[ \cot \theta + 2 \tan \frac{\theta}{2} = \frac{1}{2} \cot \frac{\theta}{2}.... show full transcript
Worked Solution & Example Answer:8. (a) (i) Using the substitution $t = \tan \frac{\theta}{2}$, or otherwise, show that
\[ \cot \theta + 2 \tan \frac{\theta}{2} = \frac{1}{2} \cot \frac{\theta}{2} - HSC - SSCE Mathematics Extension 2 - Question 8 - 2009 - Paper 1
Step 1
Using the substitution $t = \tan \frac{\theta}{2}$, or otherwise, show that
\[ \cot \theta + 2 \tan \frac{\theta}{2} = \frac{1}{2} \cot \frac{\theta}{2}. \]
96%
114 rated
Only available for registered users.
Sign up now to view full answer, or log in if you already have an account!
Show that
\[ e^{\frac{1}{n-1}} < \left(1 - \frac{1}{n} \right)^{n} < e. \]
97%
117 rated
Only available for registered users.
Sign up now to view full answer, or log in if you already have an account!
Answer
To show this inequality, we can utilize limits and properties of exponential functions. We calculate:
For the left side, using the limit definition of e.
For the right side, we recognize that (1−n1)n approaches e−1 as n increases. These provide bounding results.
Step 6
Show that $W = p + q^{n} W.$
97%
121 rated
Only available for registered users.
Sign up now to view full answer, or log in if you already have an account!
Answer
Starting from the defined probabilities, we have:
[ W = \text{Probability that } A_{1} \text{ wins immediately} + \text{Probability that they do not win immediately} \cdot W. ]
This leads directly to the established relationship.
Step 7
Use part (b) to show that, if $n$ is large, $W_{m}$ is approximately equal to $1 - e^{-p}.$
96%
114 rated
Only available for registered users.
Sign up now to view full answer, or log in if you already have an account!
Answer
This can be derived using the limits established previously:
By examining the probabilities of winning over multiple attempts m, we finally arrive at the conclusion that as n becomes significantly large, the approximation holds.