Mat9004 Assignment 2
Mat9004 Assignment 2
MAT9004 Assignment 2
Please write up your solutions neatly! In particular, use notation and terminology correctly and include some
necessary comments. Partial marks will be given for showing that you know some aspects of the answer, even if your
solution is incomplete. The questions are NOT arranged in order of difficulty, so you should attempt every question.
Both handwritten and typed solutions are accepted. Please make sure you convert all your work into one single
pdf file as other types might not display properly on moodle.
1. An advertising company plans to run an advertising campaign in three regional cities. Advertisements will be run
on TV, radio and in the local newspaper. The costs of running the same advertising program in the three cities
are $175 000, $ 149 000 and $162 000 respectively and the costs for each type in each city is shown in the table
below:
Consider the number of advertisements that were run on TV (x), on radio (y) and in the local newspaper (z).
(a) [1 point] Write a system of linear equations to represent the information above.
(b) [1 point] Write the above system in matrix form.
(c) [4 points] Find the amount of each type of advertisements using Gaussian elimination.
where a > 0 are shown in the diagram below. The graphs intersect when x = 0 and when x = m.
The area of the shaded region is 64. Find the value of a and the value of m.
3. Planet X is populated by robots of two types, U and W, that do their maintenance by rebuilding themselves in the
following way: each night, all the robots of type U get together in groups of 3 and by morning, one of the three
has been rebuilt, whilst the type W robots get together in groups of 6 and by morning one of them has been rebuilt.
Each robot would like to have more of the opposite type, so when a type U is rebuilt, it is modified to become a
type W robot, and vice versa. (You can assume that the numbers of robots are divisible by 6, so that no robots are
left outside the groups. There are so many robots that this does not significantly affect the results.)
(a) [3 points] Assuming day 0 occurred far in the distant past, let un be the number of robots of type U, and wn
of type W, on day n. Find linear equations expressing un+1 and wn+1 in terms of un and wn (n ≥ 1).
un+1 un
(b) [2 points] Find a matrix A satisfying =A for all n ≥ 1.
wn+1 wn
(c) [2 points] Find the eigenvalues of A.
(d) [2 points] Find one eigenvector corresponding to each eigenvalue.
(e) [2 points] Find matrices P and D such that D is diagonal and A = P DP −1 , hence write the expression of
An
(f) [4 points] Assume this process has been going on for a long time. Find the proportion of robots that are of
type U.
4. Consider function g : R → R, g(x) = 4 − x2 . The tangent to the graph of g(x) at a point P has a negative
gradient and intersects the y-axis at D(0, k), where 5 ≤ k ≤ 8.
5. The coordinates of three points are A(−1, 2, 4), B(1, 0, 5) and C(3, 5, 2).
(a) [1 point] Find AB.
(b) [2 points] The points A, B and C are the vertices of a triangle. Prove that the triangle is a right-angled
triangle.
6. Assume that A and B are 2 × 2 such that
A + B = AB.
(a) [2 points] Show that A − I has an inverse, where I is the identity matrix.
Total: 45 points