Questions are publicly available. Do comment if you spot any errors.
Question 1. Calculus Techniques
Solution. (a) (i) .
(a) (ii) .
(a) (iii) .
(b) .
Question 2. Normal Distribution
Solution. (a) Denoting the weight of an individual small block by , the required probability is
(b) Denoting the weight of an individual small block by , the required probability is
Hence, so that
.
(c) We have and
, so that the small block is more likely to weigh less than its labelled weight.
(d) (i) Denote , where
are independent. Then
In particular,
(d) (ii) We remark that , so that the required probability is
Question 3. Riemann Sum
Solution. (a) We sketch as follows.

(b) Using part (a),
(c) Differentiating with respect to twice,
(d) (i) for
.
(d) (ii) By part (d) (i), is concave down on
. Therefore,
Therefore,
Hence, is a better approximation for the area of the shaded region than
.
(e) Taking integrals, the required area is
Question 4. Binomial Distribution
Solution. (a) (i) Write . Then
(a) (ii) The required probability is
(a) (iii) By hypothesis, . Therefore,
By trial and error, .
(b) (i) The sample proportion is .
(b) (ii) We compute
Using a confidence interval of ,
. Therefore, the confidence interval is given by
Evaluating to 3 significant figures, .
(b) (iii) Yes; the upper bound of the confidence interval is less than .
Question 5. Graphing Techniques
Solution. (a) ,
,
.
(b) .
(c) .
(d) We sketch as follows, noting that .

(e) We sketch as follows.

It is possible that , but we drew
for simplicity.
Question 6. Differentiation Applications
Solution. (a) By the quotient rule,
(b) Denote . Differentiating with respect to
:
Setting ,
Substituting into ,
Therefore, Haz Finder cannot drive to , and thus from
to
.
(c) Solving ,
Using software, or
.
Question 7. Probability Theory
Solution. (a) (i) Using the approximation,
(a) (ii) No, since by (a) (i), .
(b) Since , the required probability would be approximately
(c) (i) calories.
(c) (ii) The sample mean is given by
Question 8. Discrete Random Variables
Solution. (a) (i) Let denote the number of points that a player receives. If
for some
and
, then
a contradiction, since the dice throw outcome
occurs with positive probability. Furthermore, every player must throw a die at least once, so that . That is, the set of dice throw outcomes such that
is empty, and thus impossible.
(a) (ii) Setting ,
Setting respectively,
Taking the disjoint union,
(b) (i) Taking the disjoint union like before,
Setting ,
(b) (ii) By hypothesis,
Solving for yields
or
. Since
is a positive integer, we must conclude that
.
Question 9. Integration Applications
Solution. (a) .
(b) .
(c) By considering the area under a curve,
(d) By symmetry, . Therefore,
(e) .
(f) .
(g) We sketch as follows, since :

Question 10. Differentiation Applications
Solution. (a) By the chain rule,
(b) (i) By (a), the stationary points are given by :
For ,
, so that the denominator is nonzero. Therefore,
In particular, , so that
. Therefore,
(b) (ii) By construction, . By Pythagoras’ theorem,
Question 11. Differentiation Techniques
Solution. (a) We sketch as follows.

(b) Using the quotient rule,
(c) (i) Using the chain rule,
Differentiating a second time,
(c) (ii) For this point of inflection, :
Since for any real
,
—Joel Kindiak, 22 Aug 26, 1904H



