Edexcel GCE A-Level Core Pure 2 (CP2) (9FM0/02) May/June 2025 • Q3a

Edexcel Further Maths May 2025 CP2 Q3(a): Mathematical Induction (Matrix Powers)

Comprehensive worked solution and examiner mark-scheme analysis by Tutor Sheefa. Focuses on mark allocation, algebraic traps, and step-by-step mathematical reasoning.

📌
Studying Cambridge International (CIE 9231)? While this question was set in the Edexcel Further Maths examination, the underlying mathematical theory and examiner rubric for 3x3 Matrices, Determinants, Inverses & Transformations are 100% applicable to CIE Paper 1 & 2.

The Exam Archetype: Matrix Proof by Mathematical Induction

Examiners do not invent new mathematics each year — they test consistent structural archetypes. In this paper, Q3a tests your ability to navigate the boundary between conceptual algebra and precise numerical computation.

Core Formulae Tested

$$M^{k+1} = M^k M \quad (\text{or } M M^k)$$

Examiner Traps & Common Mark-Scheme Penalties

  • Omitting the formal concluding induction statement: 'True for $n=1$, if true for $n=k$ then true for $n=k+1$, hence true for all $n \in \mathbb{Z}^+$ by induction.'
  • Matrix multiplication order slip (matrix multiplication is non-commutative in general).

Formal Mathematical Solution

Below is the full step-by-step derivation meeting official mark-scheme criteria for method (M) and accuracy (A) marks:

Inductive Step $M^{k+1} = M^k M$

Multiply the assumed $k$-th matrix by $M$ and factor out $2^k$ to prove the identity holds for $k+1$.

$$M^{k+1} = \begin{pmatrix} 2^k & 0 \\ k2^{k-1} & 2^k \end{pmatrix} \begin{pmatrix} 2 & 0 \\ 1 & 2 \end{pmatrix} = \begin{pmatrix} 2^{k+1} & 0 \\ (k+1)2^k & 2^{k+1} \end{pmatrix}$$
🎙️ Read Spoken Video Explanation (225 segments, 1294 words) ▾ Expand

Unedited transcript of Tutor Sheefa's spoken audio instructions during the walkthrough:

Let's take a look at question three. For question three, we have a matrix question and we want to prove this statement using mathematical induction. So, how do we do mathematical induction? We will begin by considering our original matrix. So, left hand side is equal to A to the power of n is equal to original matrix 1 0 5 2 to the power of n. But, what we would like to prove is our right hand side, where we will substitute the value of n. So, right hand side is equal to A to the power of n equal to 1 0 5 open bracket 2 to the power of n minus 1 and 2 to the power of n. There we go. Okay, so let's begin with our first step. What is What is our first step? First step will be prove that A1 is true. Okay, let's begin with the left hand side. So, left hand side A to the power of 1, which is equal to 1 0 5 2 to the power of 1, which is equal to 1 0 5 2. Let's take a look at our right hand side. Our right hand side is A to the power of 1 equal to 1 0 5 open bracket 2 to the power of 1 minus 1 2 to the power of 1. So, let's simplify. Over here, we'll have 1 0 5 open bracket 2 minus 1 and here would [snorts] be 2. This is equal to 1 0 5 2. There we go. Notice that our left hand side is equal to the right hand side. Therefore, we have proven that A1 is true. Moving on to step number two. Step number two is assumption, so we will assume that A to the power of K is true. Okay, let me use a different color for this step. So, we want to assume that A to the power of K is equal to We'll We'll use the right hand side, the one that we want to prove. 1 0 5 2 to the power of K minus 1 2 to the power of K. Okay. Is assumed to be true. Let's moving on to step three. For step three we want to prove that A to the power of K plus 1 is also true. So, A to the power of K plus 1. How can we get this? Okay, so let's start with the or with our left hand side. A to the power of K plus 1. This is actually equals to A to the power of K multiply with A to the power of 1. And what is A to the power of K? Okay, let me use a different color for this one. So, A to the power of K. A to the power of K is what we have in step number two. So, this is 1 0 5 2 to the power of K minus 1 2 to the power of K. Now, we want to multiply with A to the power of 1. This comes from step 1, which is 1 0 5 2. Next, what we have to do is we have to perform matrix multiplication, but we have unknowns, so we have to be very careful with our multiplication. We will begin by considering the first row from the first matrix and we will multiply with the first column of our second matrix. So, this would be Okay, let's refer to the first matrix. We will have 1, give it a bit of space, plus and then 5 bracket 2 to the power of K minus 1. Now, let's take a look at our second matrix first column. Okay, the first element is 1, so we're going to put it here and the second element is 0 and we're going to put it here. That's it. Next, we will change Okay, the row from the first matrix, but maintain the column from our second matrix. So, let's start with the elements from the first matrix. We will write 0. Okay, we will write 0. Give it a bit of space. The second element will be 2 to the power of K. Let's consider the elements from the second matrix. Look at the shaded element. So, the first element is 1 and the second element is 0. Moving on to the next element. Okay, we will consider first row first matrix, second column, second matrix. So, over here we'll do exactly like what we did just now. We will write the elements from the first matrix, but give it a bit of space. So, 1 plus Okay, a space plus 5 open bracket 2 to the power of K minus 1. Now, let's take a look at the element from our second matrix. So, over here in our bracket, we will have 5. Over here, we'll have 2. That's it. Now, we're going to change the column from the first We're going to change the row from our first matrix. So, this we will get 0. Give it a bit of space and then plus 2 to the power of K. Let's consider the element from our second matrix. The first bracket will be 5 and the second bracket will be 2. That's it. Okay. Let's now simplify our matrix. Over here, I will get 1 * 1 is 1 and then over here, anything multiplied by 0 would be 0. So, 1 plus 0. Over here, it will be 0 plus 0. This one would be 5 plus 5 open bracket. So, what I would like to do first is expand this one. So, that would be 2 to the power of K plus 1 minus 2. Over here, it would be 0 plus 2 to the power of K plus 1. That's it. That is our matrix. Okay. So, what I would like to do is move it slightly to the left hand side so that we have space to do our working. So, this one would be 1 0 5 plus Okay, we will expand this one now. So, it would be 5 open bracket 2 to the power of K plus 1. >> [snorts] >> Okay, close bracket minus 10. This one would be 2 to the power of K plus 1. Close bracket. This is equal to 1 0 Okay, so what we will consider now is this 5 minus 10. So, we will get 5 to the power 5 open bracket 2 to the power of K plus 1 close bracket minus 5. Where did I get that? 5 minus 10. Here, it would be 2 to the power of K plus 1. Let's zoom out. Okay. Let's check this is what we want if we compare with our right hand side. If we substitute with K plus 1, this is what we want. That means Okay, this is equal to the right hand side. Therefore, A to the power of K plus 1 is also true. Last step. Step four. Conclusion. Let's write down the conclusion. If it is true for n equals to k then it is true for n equals to k plus one. It is proven to be true for n equals to one. Therefore Okay, we will copy back the statement from our right hand side. Therefore, a to the power of n equal to 1 0 5 open bracket 2 to the power of n minus 1 2 to the power of n is true for n [snorts] all natural integers. How to know Okay. Which element we should choose? Just refer back to our question. That's it. We are done with question three part A.