題目 1 · 結構題
11 分Let \(\mathbf{M} = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\).
(a) Find \(\mathbf{M}^2\) and \(\mathbf{M}^3\). [3]
(b) Prove by mathematical induction that \(\mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}\) for all positive integers \(n\). [8]
(a) Find \(\mathbf{M}^2\) and \(\mathbf{M}^3\). [3]
(b) Prove by mathematical induction that \(\mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}\) for all positive integers \(n\). [8]
查看答案詳解收起答案詳解
解題
(a)
\(\mathbf{M}^2 = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} = \begin{pmatrix} 3(3) + (-4)(1) & 3(-4) + (-4)(-1) \\ 1(3) + (-1)(1) & 1(-4) + (-1)(-1) \end{pmatrix} = \begin{pmatrix} 5 & -8 \\ 2 & -3 \end{pmatrix}\).
\(\mathbf{M}^3 = \mathbf{M}^2 \mathbf{M} = \begin{pmatrix} 5 & -8 \\ 2 & -3 \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} = \begin{pmatrix} 5(3) + (-8)(1) & 5(-4) + (-8)(-1) \\ 2(3) + (-3)(1) & 2(-4) + (-3)(-1) \end{pmatrix} = \begin{pmatrix} 7 & -12 \\ 3 & -5 \end{pmatrix}\).
(b) Let \(H_n\) be the statement that \(\mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}\).
**Base case:** For \(n=1\), \(\mathbf{M}^1 = \begin{pmatrix} 2(1)+1 & -4(1) \\ 1 & 1-2(1) \end{pmatrix} = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} = \mathbf{M}\). Thus, \(H_1\) is true.
**Inductive step:** Assume that \(H_k\) is true for some positive integer \(k\). That is, \(\mathbf{M}^k = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix}\).
We must show that \(H_{k+1}\) is true, i.e., \(\mathbf{M}^{k+1} = \begin{pmatrix} 2(k+1)+1 & -4(k+1) \\ k+1 & 1-2(k+1) \end{pmatrix} = \begin{pmatrix} 2k+3 & -4k-4 \\ k+1 & -2k-1 \end{pmatrix}\).
We have:
\(\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M} = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\)
\(= \begin{pmatrix} (2k+1)(3) + (-4k)(1) & (2k+1)(-4) + (-4k)(-1) \\ k(3) + (1-2k)(1) & k(-4) + (1-2k)(-1) \end{pmatrix}\)
\(= \begin{pmatrix} 6k+3-4k & -8k-4+4k \\ 3k+1-2k & -4k-1+2k \end{pmatrix}\)
\(= \begin{pmatrix} 2k+3 & -4k-4 \\ k+1 & -2k-1 \end{pmatrix}\).
This is of the required form for \(n=k+1\). Since \(H_1\) is true, and \(H_k \implies H_{k+1}\), the statement \(H_n\) is true for all positive integers \(n\) by mathematical induction.
\(\mathbf{M}^2 = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} = \begin{pmatrix} 3(3) + (-4)(1) & 3(-4) + (-4)(-1) \\ 1(3) + (-1)(1) & 1(-4) + (-1)(-1) \end{pmatrix} = \begin{pmatrix} 5 & -8 \\ 2 & -3 \end{pmatrix}\).
\(\mathbf{M}^3 = \mathbf{M}^2 \mathbf{M} = \begin{pmatrix} 5 & -8 \\ 2 & -3 \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} = \begin{pmatrix} 5(3) + (-8)(1) & 5(-4) + (-8)(-1) \\ 2(3) + (-3)(1) & 2(-4) + (-3)(-1) \end{pmatrix} = \begin{pmatrix} 7 & -12 \\ 3 & -5 \end{pmatrix}\).
(b) Let \(H_n\) be the statement that \(\mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}\).
**Base case:** For \(n=1\), \(\mathbf{M}^1 = \begin{pmatrix} 2(1)+1 & -4(1) \\ 1 & 1-2(1) \end{pmatrix} = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} = \mathbf{M}\). Thus, \(H_1\) is true.
**Inductive step:** Assume that \(H_k\) is true for some positive integer \(k\). That is, \(\mathbf{M}^k = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix}\).
We must show that \(H_{k+1}\) is true, i.e., \(\mathbf{M}^{k+1} = \begin{pmatrix} 2(k+1)+1 & -4(k+1) \\ k+1 & 1-2(k+1) \end{pmatrix} = \begin{pmatrix} 2k+3 & -4k-4 \\ k+1 & -2k-1 \end{pmatrix}\).
We have:
\(\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M} = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\)
\(= \begin{pmatrix} (2k+1)(3) + (-4k)(1) & (2k+1)(-4) + (-4k)(-1) \\ k(3) + (1-2k)(1) & k(-4) + (1-2k)(-1) \end{pmatrix}\)
\(= \begin{pmatrix} 6k+3-4k & -8k-4+4k \\ 3k+1-2k & -4k-1+2k \end{pmatrix}\)
\(= \begin{pmatrix} 2k+3 & -4k-4 \\ k+1 & -2k-1 \end{pmatrix}\).
This is of the required form for \(n=k+1\). Since \(H_1\) is true, and \(H_k \implies H_{k+1}\), the statement \(H_n\) is true for all positive integers \(n\) by mathematical induction.
評分準則
(a)
M1: For attempting matrix multiplication for \(\mathbf{M}^2\).
A1: For correct \(\mathbf{M}^2\).
A1: For correct \(\mathbf{M}^3\).
(b)
B1: For verifying the base case \(n=1\) clearly.
M1: For stating the inductive hypothesis for \(n=k\).
M1: For attempting to find \(\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M}\) (or vice versa).
A1: For correctly multiplying the matrices.
A1: For simplifying algebraic expressions to the required form.
A1: For a complete and coherent inductive conclusion stating that the result holds for all positive integers.
M1: For attempting matrix multiplication for \(\mathbf{M}^2\).
A1: For correct \(\mathbf{M}^2\).
A1: For correct \(\mathbf{M}^3\).
(b)
B1: For verifying the base case \(n=1\) clearly.
M1: For stating the inductive hypothesis for \(n=k\).
M1: For attempting to find \(\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M}\) (or vice versa).
A1: For correctly multiplying the matrices.
A1: For simplifying algebraic expressions to the required form.
A1: For a complete and coherent inductive conclusion stating that the result holds for all positive integers.