Science:Math Exam Resources/Courses/MATH152/April 2010/Question A 04
• QA 1 • QA 2 • QA 3 • QA 4 • QA 5 • QA 6 • QA 7 • QA 8 • QA 9 • QA 10 • QA 11 • QA 12 • QA 13 • QA 14 • QA 15 • QA 16 • QA 17 • QA 18 • QA 19 • QA 20 • QA 21 • QA 22 • QA 23 • QA 24 • QA 25 • QA 26 • QA 27 • QA 28 • QA 29 • QA 30 • QB 1(a) • QB 1(b) • QB 1(c) • QB 2(a) • QB 2(b) • QB 3(a) • QB 3(b) • QB 3(c) • QB 3(d) • QB 4(a) • QB 4(b) • QB 4(c) • QB 4(d) • QB 4(e) • QB 5(a) • QB 5(b) • QB 6(a) • QB 6(b) • QB 6(c) • QB 6(d) • QB 6(e) •
Question A 04
Circle the one correct answer below. A linear system of four equations in three unknowns has
(a)always a unique solution (b)either a unique solution or no solutions (c)either a unique solution or an infinite number of solutions (d)either no solutions or an infinite number of solutions (e)either no solutions, a unique solution, or an infinite number of 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 hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it!
Conditions on one, infinite, or no solutions depend on zero rows in the matrix, what kind of conditions create those?
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.
Found a typo? Is this solution unclear? Let us know here.
Please rate my easiness! It's quick and helps everyone guide their studies.
Recall the conditions for a unique solution, no solution and an infinite number of solutions. For a unique solution, the row reduced matrix must be the identity matrix so that each unknown has precisely one determined value (hence unique). For no solutions to occur we need either a contradiction (i.e. trying to determine that an unknown takes on two values) or we need an impossible situation (i.e. trying to determine that 0x=7). For an infinite number of solutions we need a free variable in the form 0z=0.
We have 4 equations and 3 unknowns so our matrix is . We are trying to determine three variables with 4 conditions. Recall that to determine n unknowns we need exactly n equations (i.e. we only need 3 conditions here). Therefore, the only way we will get a unique solution is if one of the equations is redundant information (so that in actuality we only have 3 conditions). This would appear in the matrix as a row of zeros (since one row will be a multiple of another). For example, consider a system row reduced as follows
If we call our unknowns, x,y, and z then we see that x=7, y=2, z=4 and then the last row tells us 0x+0y+0z=0 which holds true and so we have a unique solution.
If the 4th condition was not simply redundant information but rather a independent condition then we could row reduce to get something of the form
Here we still are determining that x=7, y=2, and z=4 but we also require that 0x+0y+0z=12 which doesn't hold true for these values (in fact it will never hold true) and therefore all 4 conditions can't be satisfied so this results in no solution.
We have considered when there is no redundancy in the constraints and when one condition is redundant. What if multiple conditions are redundant? Let's say we have a model with the following constraints
Notice that equation 3 is just 2 times equation 1 and equation 4 is 3 times equation 1. Therefore, really 3 of the four equations are just saying that 1x+2y+3z=5. The row reduced matrix would be
In this example we have a free variable because we only have 2 pivots. Therefore let z=t. Then we conclude that
Here we see that there are actually an infinite number of solutions depending on the parameter t.
Therefore we have constructed examples where we can have unique solutions, no solutions, or an infinite number of solutions and thus we see the answer is (e)