MATH221 April 2013
• Q1 • Q2 (a) • Q2 (b) • Q2 (c) • Q2 (d) • Q3 • Q4 • Q5 • Q6 • Q7 (a) • Q7 (b) • Q7 (c) • Q8 • Q9 • Q10 • Q11 • Q12 (a) • Q12 (b) • Q12 (c) •
[hide]Question 01
|
Consider the system of linear equations:

For which values of h and k does the system have:
a) no solutions?
b) exactly one solution?
c) infinitely many solutions?
|
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 hints below. Read the first one and consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it! If after a while you are still stuck, go for the next hint.
|
[show]Hint 1
|
Writing this system in matrix form, what will tell about the number of solutions?
|
[show]Hint 2
|
Pick carefully which row manipulations you will do, they will simplify your calculations quite a bit.
|
Checking a solution serves two purposes: helping you if, after having used all the hints, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
- If you are stuck on a problem: Read the solution slowly and as soon as you feel you could finish the problem on your own, hide it and work on the problem. Come back later to the solution if you are stuck or if you want to check your work.
- If you want to check your work: Don't only focus on the answer, problems are mostly marked for the work you do, make sure you understand all the steps that were required to complete the problem and see if you made mistakes or forgot some aspects. Your goal is to check that your mental process was correct, not only the result.
|
[show]Solution
|
We can write this system in matrix form:
![{\displaystyle \left[{\begin{array}{ccc}3&4&7\\-9&6&9\\45&-12&h\end{array}}\right]\left[{\begin{array}{c}x\\y\\z\end{array}}\right]=\left[{\begin{array}{c}3\\3\\k\end{array}}\right]}](https://wiki.ubc.ca/api/rest_v1/media/math/render/svg/d959c32990a374b038de61a08662fd0aa7a0682a)
To know the number of solutions, we want to look at the row reduced form of the augmented matrix.
First, perform the operations L3 → L3+5L2 and L2 → L2-3L1
![{\displaystyle \left[{\begin{array}{cccc}3&4&7&3\\-9&6&9&3\\45&-12&h&k\end{array}}\right]\sim \left[{\begin{array}{cccc}3&4&7&3\\0&18&30&12\\0&18&45+h&15+k\end{array}}\right]}](https://wiki.ubc.ca/api/rest_v1/media/math/render/svg/609fed092f0b9496822de928108a76aa5a93e59d)
Then, perform L3 → L3 - L2
![{\displaystyle \sim \left[{\begin{array}{cccc}3&4&7&3\\0&18&30&12\\0&0&15+h&3+k\end{array}}\right]}](https://wiki.ubc.ca/api/rest_v1/media/math/render/svg/92a7ddb8cf6eee705cc42d7840d02ba889d42cf4)
Noting that the first two rows of the matrix give a matrix of rank at least 2, the number of solutions depend only on the last row. We read the last row of this matrix and we obtain the equation

We can now read off the solutions from this equation base on whether or not and are equal to zero.
a) No solution if
b) One solution if
c) Infinite solution if
Notice that this convers all possible values for and .
|
|
Math Learning Centre
- A space to study math together.
- Free math graduate and undergraduate TA support.
- Mon - Fri: 12 pm - 5 pm in MATH 102 and 5 pm - 7 pm online through Canvas.
|