PastPaper.question 1 · Short Structured
6 PastPaper.marksProve by mathematical induction that, for all positive integers \(n\), \[ \begin{pmatrix} 2 & 1 \\ 0 & 3 \end{pmatrix}^n = \begin{pmatrix} 2^n & 3^n - 2^n \\ 0 & 3^n \end{pmatrix}. \]
PastPaper.showAnswersPastPaper.hideAnswers
PastPaper.workedSolution
Let \(H_n\) be the proposition that \(\mathbf{A}^n = \begin{pmatrix} 2^n & 3^n - 2^n \\ 0 & 3^n \end{pmatrix}\), where \(\mathbf{A} = \begin{pmatrix} 2 & 1 \\ 0 & 3 \end{pmatrix}\). For \(n = 1\), \(\mathbf{A}^1 = \begin{pmatrix} 2 & 1 \\ 0 & 3 \end{pmatrix}\) and the formula gives \(\begin{pmatrix} 2^1 & 3^1 - 2^1 \\ 0 & 3^1 \end{pmatrix} = \begin{pmatrix} 2 & 1 \\ 0 & 3 \end{pmatrix}\). Thus, \(H_1\) is true. Assume that \(H_k\) is true for some positive integer \(k\), so \(\mathbf{A}^k = \begin{pmatrix} 2^k & 3^k - 2^k \\ 0 & 3^k \end{pmatrix}\). We now consider the case \(n = k + 1\): \(\mathbf{A}^{k+1} = \mathbf{A}^k \mathbf{A} = \begin{pmatrix} 2^k & 3^k - 2^k \\ 0 & 3^k \end{pmatrix} \begin{pmatrix} 2 & 1 \\ 0 & 3 \end{pmatrix}\). Multiplying these matrices gives: Row 1, Column 1: \(2^k \times 2 + (3^k - 2^k) \times 0 = 2^{k+1}\). Row 1, Column 2: \(2^k \times 1 + (3^k - 2^k) \times 3 = 2^k + 3^{k+1} - 3 \cdot 2^k = 3^{k+1} - 2 \cdot 2^k = 3^{k+1} - 2^{k+1}\). Row 2, Column 1: \(0 \times 2 + 3^k \times 0 = 0\). Row 2, Column 2: \(0 \times 1 + 3^k \times 3 = 3^{k+1}\). Thus, \(\mathbf{A}^{k+1} = \begin{pmatrix} 2^{k+1} & 3^{k+1} - 2^{k+1} \\ 0 & 3^{k+1} \end{pmatrix}\). Therefore, \(H_k \implies H_{k+1}\). Since the base case \(H_1\) is true and \(H_k \implies H_{k+1}\), by the principle of mathematical induction, the statement is true for all positive integers \(n\).
PastPaper.markingScheme
B1: Verifies the base case \(n = 1\) showing LHS = RHS.
M1: Assumes the formula holds for \(n = k\).
M1: Attempts to find \(\mathbf{A}^{k+1}\) by multiplying \(\mathbf{A}^k \mathbf{A}\) (or \(\mathbf{A} \mathbf{A}^k\)).
A1: Obtains the correct product entries before simplification, particularly showing the calculation of the top-right entry: \(2^k + 3(3^k - 2^k)\).
A1: Correctly simplifies all entries to show \(\mathbf{A}^{k+1}\) is in the required form.
A1: Provides a clear, logical concluding statement referencing the principle of mathematical induction.
M1: Assumes the formula holds for \(n = k\).
M1: Attempts to find \(\mathbf{A}^{k+1}\) by multiplying \(\mathbf{A}^k \mathbf{A}\) (or \(\mathbf{A} \mathbf{A}^k\)).
A1: Obtains the correct product entries before simplification, particularly showing the calculation of the top-right entry: \(2^k + 3(3^k - 2^k)\).
A1: Correctly simplifies all entries to show \(\mathbf{A}^{k+1}\) is in the required form.
A1: Provides a clear, logical concluding statement referencing the principle of mathematical induction.