I shall continue to add more as I go along. Feel free to dispute.
Core:
Question 1.
a.
i. 20 degrees Celsius.
ii. 23.3%.
b. 97.5%.
Question 2.
Sketch: the best points were probably (0,13) and (20, 26.4).
b. When the minimum temperature is 0, the maximum will be 13 degrees Celsius.
c. Direction: positive. Strength: moderate.
d. For every increase of 1 degrees Celsius in minimum temperature, there is a resultant increase of 0.67 degrees Celsius in maximum temperature.
e. 40%.
f. -8 degrees Celsius.
Question 3.
a. South-east, North-east.
b. 2,2,2,3,4,4,4,4. Note: this question was not ambiguous and to obtain this answer you had to reason through the five-figure summary provided (minimum: 2, quartile 1: 2, median: 3.5, quartile 3: 4, maximum: 4).
Question 4.
a. y= 3.4 + 6.6x.
b. 13 kilometres per hour.
Number patterns:
Question 1.
a. 156 - 162 = 162 - 168 = -6.
b. The sixth term of this arithmetic sequence is: 138.
c. The difference between the eighth term and the tenth term is 12.
d. The sum of the first 18 terms is 2,106.
ii. The amount of time taken for no more blocks of land to be sold was 29 months. Hence, the answer is the difference between the sum of the first 29 terms and the first 18 terms, which is 330.
Question 2.
a. The third term is 36.
b. The nth term is greater than 100 when n is approximately 5.52. Therefore, it happens in the 6th year.
c. The sum of the first five terms of this geometric sequence is 211.
d. The sum of this geometric series is greater than 1000 when n = 8.57. Therefore, in the 9th year.
e. a = 1.5, b = 0, c = 16.
Question 3. (For this, it is advised you solve for the nth term of the difference equation, see page. 329 of the Essentials textbook for details.
a. The third term of our difference equation is 1026.08, so 1026 to the nearest whole number.
b. The nth term is greater than 4000 when n = 10.35. Hence, in the 11th year.
c. I suggest to graph the nth term and you will see from its equation that 12,500 is an asymptote, and therefore the correct answer. Although other more rigorous methods are acceptable.
Graphs & relations:
Question 1.
a.
i. The gradient = 50.
ii. C = 20,000 + 50n.
b.
i. Sketch the line R = 150n. Label the origin and the intercept between the Cost-graph and the Revenue-graph (200,30,000) as well as labeling the equation on the graph. (I'm not sure how much of that is a requirement for the mark.
ii. 54,000/150 = 360 phones.
c. When R = C, the number of phones is 200.
Question 2.
a. When R = C, the number of laptops is 446.43. But you would need to sell 447 to be profiting, and at 446 you are still in a negative profit (only by a small amount).
b. When R = C, the number of laptops is now 400. Therefore, the new selling price is $682.50.
Question 3.
a. The time available to repair all the mobile phones and laptops in one day must be less than or equal to 1,750 minutes. (Just because there's only 1,440 minutes in a day does not make this question incorrect.) I would suppose that the company that repairs these devices only has a total of 1,750 minutes worth of time shared between all their workers.
b. At most 8 laptops can be repaired for every 10 phones.
c. Sketch the line: 35x + 50y = 1750, make sure to label the x-intercept; y-intercept; and the equation of the line on the graph.
d. The highest y-value that is possible based on the constraints is 18.67 (56/3 in exact value), this means 18 laptops is the maximum possible.
e. Sketch the line y = 9 on the graph, find the two points of intersection, the maximum will be the highest value, which is 37.14, and the minimum, which is 11.25. Now, this means 37 phones is the maximum that can occur.
f.
i. $P(x,y) = 60x + 100y. Corner-point principle tells us that the maximum value of this will occur either on (0,0); (70/3, 58/3); or (50,0). Now, this is where you must be careful. The laptops cannot exceed 18.67, and so cannot exceed 18. This means that if you manufacture 19 laptops, your co-ordinates will be outside of the feasible region. Therefore, the point that will be inside the feasible region will be (24,18), because we're dealing with a real-life, integer problem. Substituting all these values into the objective function yields: $0; $3,240; $3,000. Therefore, the answer to this question is 24 phones and 18 laptops.
ii. This question is technically answered by solving the question above (good one VCAA). Irrespective of that, the answer is P(24,18) = $3,240.
Matrices:
Question 1.
a. Anvil and Dantel.
b. Anvil, Berga, Dantel, then to Cantor.
c. [1 2 1 1].
d. The matrix G tells us the total amount of locations you can travel to from locations A, B, C and D respectively. (i.e., they've summed the columns).
Question 2.
a.
i. The matrix C is as follows (it is a 2 by 3 matrix).
[1 3 2]
[3 9 6]
ii. 133926.
b. A = B^{-1} x C. For this question, it would've been advisable to show full working of how you multiply matrix C by the inverse of B, and in the order shown above, because matrices are not commutative. For example, saying A = C x B^{-1} would've been incorrect. I think showing how to calculate the inverse of B, stating the above equation and then the result should be sufficient for this question.
Question 3.
a. 0.7 x 100 + 0.8 x 200 + 0.9 x 50 = 275. So 275 won't rotate to a different position.
b. The meaning of a_{4},{4} is that, 100% of the people who leave in this year are divorced from the company permanently. I.e., it is a one-way ticket out of the company if you leave.
c.
i. (This is a 4 by 1 matrix)
[70]
[170]
[65]
[45]
ii. Entry_{2},{1} in T^{2} x Initial State is 143. Therefore, 143 operators are expected to be there.
iii. This question is asking when will Entry_{2},{1} be less than 30. A pragmatic approach would be to continually multiply matrix S by T until the desired result is found. Doing this yields T^{10} x Initial State to be the first matrix where the number of operators is less than 30. Therefore, this is 10 years after 2011. And so the answer to this question is 2021.
iv. Evaluating T^{n} x Initial State for large values of n should reveal that, eventually, there will be nobody left at the company.
d. Evaluating S_{2013} using the difference equation yields a value of 182 for Entry_{2},{1}, and so there shall be 182 operators who are expected to be working there.