Work in progress: this question page is incomplete, there might be mistakes in the material you are seeing here.
• Q1 (a) • Q1 (b) • Q1 (c) • Q1 (d) • Q1 (e) • Q1 (f) • Q2 (a) • Q2 (b) • Q2 (c) • Q2 (d) • Q2 (e) • Q2 (f) • Q3 (a) • Q3 (b) • Q3 (c) • Q3 (d) • Q4 (a) • Q4 (b) • Q4 (c) • Q5 (a) • Q5 (b) • Q5 (c) • Q5 (d) • Q5 (e) • Q6 (a) • Q6 (b) • Q6 (c) •
Question 04 (a)
Consider the following recursion relation:
where , and
Find the matrix so that for all n, we have
Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you?
If you are stuck, check the hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it!
Checking a solution serves two purposes: helping you if, after having used the hint, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
It’s relatively simple to find the matrix we want. Using the relation given above and the knowledge that , we can see that the relation can be defined by the matrix equation:
but we want to define the term by a combination of and by having a matrix
We know what is,
So let’s use that knowledge and continue:
and when =
but we know what is, it’s merely
continuing along the trend above, we can see that, in general,