Linear Algebra Quiz: Consistent Vs Inconsistent Systems
17 questions · exam conditions
0:00
Consistent Vs Inconsistent SystemsQuestion 1 of 17

Consider the system of equations represented by the matrix equation Ax=bA\mathbf{x} = \mathbf{b}, where AA is a 4×54 \times 5 matrix with rank 3. Under what condition is this system guaranteed to be consistent?

When the rank of the augmented matrix [Ab][A|\mathbf{b}] equals 4
When the rank of the augmented matrix [Ab][A|\mathbf{b}] equals 3
When vector b\mathbf{b} is in the null space of ATA^T
When vector b\mathbf{b} has exactly 3 non-zero components
← Back to quizzes

Linear Algebra Quiz

Linear Algebra Quiz: Consistent Vs Inconsistent Systems

Practice Consistent Vs Inconsistent Systems in Linear Algebra with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.

What this quiz covers

This quiz focuses on Consistent Vs Inconsistent Systems, giving you a quick way to practice the rules, question types, and explanations that matter most for Linear Algebra.

How to use this quiz

Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.

All questions

Question 1

Consider the system of equations represented by the matrix equation Ax=bA\mathbf{x} = \mathbf{b}, where AA is a 4×54 \times 5 matrix with rank 3. Under what condition is this system guaranteed to be consistent?

  1. When the rank of the augmented matrix [Ab][A|\mathbf{b}] equals 4
  2. When the rank of the augmented matrix [Ab][A|\mathbf{b}] equals 3 (correct answer)
  3. When vector b\mathbf{b} is in the null space of ATA^T
  4. When vector b\mathbf{b} has exactly 3 non-zero components
Explanation: A system Ax=bA\mathbf{x} = \mathbf{b} is consistent if and only if rank(A)=rank([Ab])\text{rank}(A) = \text{rank}([A|\mathbf{b}]). Since AA has rank 3, the system is consistent when the augmented matrix also has rank 3, meaning b\mathbf{b} lies in the column space of AA. Option A would mean b\mathbf{b} is linearly independent from all columns of AA, making the system inconsistent. Option C describes when Ab=0A\mathbf{b} = \mathbf{0}, not Ax=bA\mathbf{x} = \mathbf{b}. Option D is irrelevant to consistency.

Question 2

A manufacturer produces three products: P1, P2, and P3. Each unit of P1 requires 1 hour of labor and 2 lbs of material. Each unit of P2 requires 2 hours of labor and 4 lbs of material. Each unit of P3 requires 3 hours of labor and 6 lbs of material. For a specific production run, the manufacturer has exactly 40 hours of labor available. The total material required for this run is kk lbs. For which value of kk is it impossible to find a combination of products that meets these exact constraints?

  1. k=40k = 40
  2. k=60k = 60
  3. k=80k = 80
  4. k=100k = 100 (correct answer)
Explanation: Let x1,x2,x3x_1, x_2, x_3 be the number of units produced for products P1, P2, and P3, respectively. The constraints can be modeled by a system of linear equations: Labor: 1x1+2x2+3x3=401x_1 + 2x_2 + 3x_3 = 40 Material: 2x1+4x2+6x3=k2x_1 + 4x_2 + 6x_3 = k Notice that the coefficients of the variables in the material equation are exactly twice the coefficients in the labor equation. If we multiply the entire first equation by 2, we get 2(1x1+2x2+3x3)=2(40)2(1x_1 + 2x_2 + 3x_3) = 2(40), which simplifies to 2x1+4x2+6x3=802x_1 + 4x_2 + 6x_3 = 80. For the system to be consistent (i.e., for a solution to exist), the second equation must be equivalent to this. This means we must have k=80k = 80. If k=80k=80, there are infinitely many production combinations possible. If kk is any value other than 80, the two equations contradict each other, and the system is inconsistent, meaning no combination of products is possible. Out of the given choices, k=100k=100 makes the system inconsistent.

Question 3

During Gaussian elimination of an augmented matrix, a student obtains the row [00005][0 \, 0 \, 0 \, 0 \, | \, 5] in the fourth position. However, they continue elimination and eventually this row becomes [00000][0 \, 0 \, 0 \, 0 \, | \, 0]. What can be concluded about the original system?

  1. The original system was inconsistent, and the student made an error in their calculations (correct answer)
  2. The original system was consistent with infinitely many solutions
  3. The original system was consistent with a unique solution
  4. The student's work is impossible since elementary row operations cannot change [00005][0 \, 0 \, 0 \, 0 \, | \, 5] to [00000][0 \, 0 \, 0 \, 0 \, | \, 0]
Explanation: Elementary row operations preserve the solution set of a system. Once a row [00005][0 \, 0 \, 0 \, 0 \, | \, 5] appears, it indicates the equation 0=50 = 5, which means the system is inconsistent. This row cannot be transformed to [00000][0 \, 0 \, 0 \, 0 \, | \, 0] through valid elementary row operations. The only way this could happen is if the student made a computational error. Elementary row operations can only: (1) multiply a row by a non-zero constant, (2) swap rows, or (3) add/subtract multiples of rows. None of these can change 5 to 0 in the augmented column when all other entries in that row are zero.

Question 4

The system {x+y+z=62x+2y+2z=123x+3y+3z=k\begin{cases} x + y + z = 6 \\ 2x + 2y + 2z = 12 \\ 3x + 3y + 3z = k \end{cases} has infinitely many solutions. A student claims that any value of kk will work because "all equations are multiples of each other." What is wrong with this reasoning?

  1. The student is correct; any value of kk gives infinitely many solutions
  2. Only k=18k = 18 gives infinitely many solutions; other values make the system inconsistent (correct answer)
  3. Only k=0k = 0 gives infinitely many solutions; other values give a unique solution
  4. The system has a unique solution x=y=z=2x = y = z = 2 regardless of the value of kk
Explanation: The first equation gives x+y+z=6x + y + z = 6. The second equation 2x+2y+2z=122x + 2y + 2z = 12 is indeed 22 times the first equation, so it's redundant. For the third equation to be consistent, we need 3x+3y+3z=3(x+y+z)=3(6)=183x + 3y + 3z = 3(x + y + z) = 3(6) = 18. Therefore, k=18k = 18. If k18k ≠ 18, the third equation contradicts the first equation (scaled appropriately), making the system inconsistent. The student's error is assuming that visual similarity (coefficients being multiples) automatically ensures consistency without checking that the constants are also proportional.

Question 5

A system of equations has the reduced row echelon form $$ \begin{bmatrix} 1 & 0 & 2 & 0 & | & 5 \ 0 & 1 & -1 & 0 & | & 3 \ 0 & 0 & 0 & 1 & | & -2 \ 0 & 0 & 0 & 0 & | & 0 \end{bmatrix}

  1. The system is inconsistent because there are more variables than equations with leading ones
  2. The system is consistent with infinitely many solutions because the last row is all zeros
  3. The system is consistent with infinitely many solutions because there is a free variable (correct answer)
  4. The system is consistent with a unique solution because all pivot columns are identified
Explanation: The system is consistent because there are no rows of the form [0000c][0 \, 0 \, 0 \, 0 \, | \, c] where c0c ≠ 0. The variables corresponding to columns 1, 2, and 4 are basic variables (leading variables), while the variable corresponding to column 3 is a free variable. Since there is at least one free variable, the system has infinitely many solutions.

Question 6

Matrix AA is 4×64 \times 6 with rank 4, and matrix BB is 4×14 \times 1. The system Ax=BA\mathbf{x} = B is known to be consistent. A second system Ax=2BA\mathbf{x} = 2B is formed. Which statement about the relationship between these two systems is correct?

  1. If the first system has infinitely many solutions, the second system is guaranteed to be inconsistent
  2. Both systems must have the same number of solutions since 2B2B is a scalar multiple of BB
  3. The second system may be inconsistent even though the first system is consistent
  4. The second system is guaranteed to be consistent and has the same solution structure as the first (correct answer)
Explanation: When you encounter problems about linear systems with scalar multiples of the right-hand side vector, think about how consistency and solution structure relate to the column space and null space of the coefficient matrix. Since Ax=BA\mathbf{x} = B is consistent, vector BB lies in the column space of AA. The key insight is that column spaces are closed under scalar multiplication—if BB is in the column space, then any scalar multiple like 2B2B is also in the column space. This guarantees that Ax=2BA\mathbf{x} = 2B is consistent. Moreover, both systems have identical solution structures. Since AA is 4×64 \times 6 with rank 4, the null space has dimension 64=26 - 4 = 2. Any consistent system Ax=cA\mathbf{x} = \mathbf{c} will have infinitely many solutions (a particular solution plus the 2-dimensional null space). If x0\mathbf{x}_0 solves Ax=BA\mathbf{x} = B, then 2x02\mathbf{x}_0 solves Ax=2BA\mathbf{x} = 2B, and both have the same infinite solution set structure. Option A is wrong because scalar multiples preserve consistency—there's no mechanism for the second system to become inconsistent. Option B correctly notes both have the same number of solutions but gives an incomplete reason. Option C incorrectly suggests the second system might be inconsistent, ignoring that column spaces are closed under scalar operations. Study tip: Remember that if a vector is in a subspace (like the column space), then all its scalar multiples are too. This principle frequently appears in consistency problems involving scaled right-hand sides.

Question 7

The augmented matrix of a system of linear equations has been reduced to the following form: [1234015600a29a3]\left[ \begin{array}{ccc|c} 1 & 2 & 3 & 4 \\ 0 & 1 & 5 & 6 \\ 0 & 0 & a^2-9 & a-3 \end{array} \right] For what value(s) of aa is the system inconsistent?

  1. a=3a = 3
  2. a=3a = -3 (correct answer)
  3. a=3a = 3 or a=3a = -3
  4. Any value except a=3a=3 or a=3a=-3
Explanation: A system is inconsistent if its row-echelon form contains a row of the form [0,0,,0c][0, 0, \dots, 0 | c] where cc is a non-zero constant. In this matrix, the last row corresponds to the equation (a29)x3=a3(a^2-9)x_3 = a-3. For this equation to represent a contradiction (0=c0 = c with c0c \neq 0), we need the coefficient of x3x_3 to be zero and the constant on the right-hand side to be non-zero.
  1. Set the coefficient to zero: a29=0    (a3)(a+3)=0a^2 - 9 = 0 \implies (a-3)(a+3) = 0. This gives a=3a=3 or a=3a=-3.
  2. Set the constant term to be non-zero: a30    a3a-3 \neq 0 \implies a \neq 3.
Both conditions must be met simultaneously. The value from the first condition that also satisfies the second condition is a=3a=-3. If a=3a=3, the last row becomes [0,0,00][0, 0, 0 | 0], which indicates infinitely many solutions, not an inconsistent system.

Question 8

Let A=(1224)A = \begin{pmatrix} 1 & 2 \\ 2 & 4 \end{pmatrix}. The system Ax=bA\mathbf{x} = \mathbf{b} is consistent if and only if b\mathbf{b} is in the column space of AA. For which of the following vectors b\mathbf{b} is the system consistent?

  1. b=(13)\mathbf{b} = \begin{pmatrix} 1 \\ 3 \end{pmatrix}
  2. b=(36)\mathbf{b} = \begin{pmatrix} 3 \\ 6 \end{pmatrix} (correct answer)
  3. b=(22)\mathbf{b} = \begin{pmatrix} 2 \\ 2 \end{pmatrix}
  4. b=(01)\mathbf{b} = \begin{pmatrix} 0 \\ 1 \end{pmatrix}
Explanation: The column space of AA is the set of all possible linear combinations of its column vectors. The columns of AA are c1=(12)\mathbf{c}_1 = \begin{pmatrix} 1 \\ 2 \end{pmatrix} and c2=(24)\mathbf{c}_2 = \begin{pmatrix} 2 \\ 4 \end{pmatrix}. Notice that c2=2c1\mathbf{c}_2 = 2\mathbf{c}_1. This means the two columns are linearly dependent, and the column space is simply the set of all scalar multiples of the first column vector. So, a vector b=(b1b2)\mathbf{b} = \begin{pmatrix} b_1 \\ b_2 \end{pmatrix} is in the column space of AA if it is of the form c(12)c \begin{pmatrix} 1 \\ 2 \end{pmatrix} for some scalar cc. This implies that the second component must be twice the first component, i.e., b2=2b1b_2 = 2b_1. We check the answer choices: (A) 32(1)3 \neq 2(1) (B) 6=2(3)6 = 2(3). This vector is in the column space. (C) 22(2)2 \neq 2(2) (D) 12(0)1 \neq 2(0) Therefore, the system is consistent only for b=(36)\mathbf{b} = \begin{pmatrix} 3 \\ 6 \end{pmatrix}.

Question 9

Let xp=(102)\mathbf{x}_p = \begin{pmatrix} 1 \\ 0 \\ 2 \end{pmatrix} be a solution to the linear system Ax=bA\mathbf{x} = \mathbf{b}. You are also told that xh=(110)\mathbf{x}_h = \begin{pmatrix} -1 \\ 1 \\ 0 \end{pmatrix} is a solution to the corresponding homogeneous system Ax=0A\mathbf{x} = \mathbf{0}. Which of the following vectors is also a solution to Ax=bA\mathbf{x} = \mathbf{b}?

  1. (212)\begin{pmatrix} 2 \\ -1 \\ 2 \end{pmatrix} (correct answer)
  2. (010)\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}
  3. (212)\begin{pmatrix} 2 \\ 1 \\ 2 \end{pmatrix}
  4. (110)\begin{pmatrix} -1 \\ 1 \\ 0 \end{pmatrix}
Explanation: The general solution to a non-homogeneous system Ax=bA\mathbf{x} = \mathbf{b} is given by x=xp+cxh\mathbf{x} = \mathbf{x}_p + c\mathbf{x}_h, where xp\mathbf{x}_p is a particular solution, xh\mathbf{x}_h is a non-trivial solution to the associated homogeneous system Ax=0A\mathbf{x} = \mathbf{0}, and cc is any scalar. This is because A(xp+cxh)=Axp+c(Axh)=b+c(0)=bA(\mathbf{x}_p + c\mathbf{x}_h) = A\mathbf{x}_p + c(A\mathbf{x}_h) = \mathbf{b} + c(\mathbf{0}) = \mathbf{b}. We are given xp=(102)\mathbf{x}_p = \begin{pmatrix} 1 \\ 0 \\ 2 \end{pmatrix} and xh=(110)\mathbf{x}_h = \begin{pmatrix} -1 \\ 1 \\ 0 \end{pmatrix}. Any other solution will have the form (102)+c(110)=(1cc2)\begin{pmatrix} 1 \\ 0 \\ 2 \end{pmatrix} + c \begin{pmatrix} -1 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1-c \\ c \\ 2 \end{pmatrix}. We check the options to see if they can be written in this form for some value of cc. (A) For (212)\begin{pmatrix} 2 \\ -1 \\ 2 \end{pmatrix}: The second component implies c=1c=-1. Let's check if this works for the first component: 1c=1(1)=21 - c = 1 - (-1) = 2. The third component is 2, which matches. This vector is a solution for c=1c=-1. (B) For (010)\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}: The second component implies c=1c=1. The third component should be 2, but it is 0. Not a solution. (C) For (212)\begin{pmatrix} 2 \\ 1 \\ 2 \end{pmatrix}: The second component implies c=1c=1. The first component should be 11=01-1=0, but it is 2. Not a solution. (D) (110)\begin{pmatrix} -1 \\ 1 \\ 0 \end{pmatrix} is a solution to the homogeneous system, not the non-homogeneous one (unless b=0\mathbf{b}=\mathbf{0}).

Question 10

A homogeneous system Ax=0A\mathbf{x} = \mathbf{0} where AA is a 3×53 \times 5 matrix has a non-trivial solution. If we modify this to the non-homogeneous system Ax=bA\mathbf{x} = \mathbf{b} where b0\mathbf{b} \neq \mathbf{0}, which statement is necessarily true?

  1. The non-homogeneous system is always inconsistent when b0\mathbf{b} \neq \mathbf{0}
  2. The non-homogeneous system has a unique solution if it is consistent
  3. The consistency of the non-homogeneous system depends only on the rank of matrix AA
  4. The non-homogeneous system has infinitely many solutions if it is consistent (correct answer)
Explanation: When you encounter questions about homogeneous versus non-homogeneous linear systems, focus on how the null space structure affects solution behavior. Since AA is 3×53 \times 5, there are more variables than equations. The homogeneous system Ax=0A\mathbf{x} = \mathbf{0} having a non-trivial solution tells us that rank(A)<5\text{rank}(A) < 5, meaning the null space of AA is non-trivial with dimension at least 5rank(A)15 - \text{rank}(A) \geq 1. This null space structure is crucial: if the non-homogeneous system Ax=bA\mathbf{x} = \mathbf{b} has any solution xp\mathbf{x}_p, then its general solution is x=xp+xh\mathbf{x} = \mathbf{x}_p + \mathbf{x}_h, where xh\mathbf{x}_h is any solution to the homogeneous system. Since we know the homogeneous system has infinitely many non-trivial solutions, the non-homogeneous system must have infinitely many solutions whenever it's consistent. This confirms answer D. A is wrong because consistency depends on whether b\mathbf{b} lies in the column space of AA—this isn't automatically impossible just because b0\mathbf{b} \neq \mathbf{0}. B is wrong because the non-trivial null space guarantees infinitely many solutions, never a unique solution. C is wrong because consistency depends on both rank(A)\text{rank}(A) and rank([Ab])\text{rank}([A|\mathbf{b}])—specifically, whether b\mathbf{b} is in the column space of AA. Key takeaway: When a homogeneous system has non-trivial solutions, any consistent non-homogeneous system with the same coefficient matrix will have infinitely many solutions due to the inherited null space structure.

Question 11

Consider the system of linear equations: {3x+2y=76x+ky=10\begin{cases} 3x + 2y = 7 \\ 6x + ky = 10 \end{cases} For which value of kk is the system inconsistent?

  1. k=4k = -4
  2. k=4k = 4 (correct answer)
  3. k=107k = \frac{10}{7}
  4. k=307k = \frac{30}{7}
Explanation: For a 2x2 system of linear equations to be inconsistent, the lines they represent must be parallel and have different y-intercepts. Two lines are parallel if their slopes are equal. The slope of the first line, y=32x+72y = -\frac{3}{2}x + \frac{7}{2}, is 32-\frac{3}{2}. The slope of the second line, y=6kx+10ky = -\frac{6}{k}x + \frac{10}{k}, is 6k-\frac{6}{k}. Setting the slopes equal gives: 32=6k-\frac{3}{2} = -\frac{6}{k} This simplifies to 3k=123k = 12, so k=4k=4. When k=4k=4, the second equation becomes 6x+4y=106x + 4y = 10, which simplifies to 3x+2y=53x + 2y = 5. The system is now 3x+2y=73x + 2y = 7 and 3x+2y=53x + 2y = 5, which is a contradiction (757 \neq 5). Therefore, the system is inconsistent when k=4k=4.

Question 12

A system of linear equations consists of three distinct lines in the xy-plane: x+y=3x+y=3, 2x+2y=k2x+2y=k, and xy=1x-y=1. For which value of kk is the system consistent?

  1. k=1k=1
  2. k=3k=3
  3. k=6k=6 (correct answer)
  4. The system is never consistent.
Explanation: The first two equations are x+y=3x+y=3 and 2x+2y=k2x+2y=k. The lines they represent are parallel because the coefficients of xx and yy in the second equation are twice those in the first. For a system containing these two equations to be consistent, the lines must be identical (coincident). This occurs if the constant term is also scaled by the same factor. Thus, we must have k=2×3=6k = 2 \times 3 = 6. If k=6k=6, the first two equations are redundant, and the system effectively becomes: {x+y=3xy=1\begin{cases} x+y=3 \\ x-y=1 \end{cases} This is a system of two distinct, non-parallel lines, which has a unique solution. Adding the two equations gives 2x=4    x=22x=4 \implies x=2, and substituting back gives 2+y=3    y=12+y=3 \implies y=1. The unique solution is (2,1)(2,1). If k6k \neq 6, the first two lines are parallel and distinct, meaning there is no point (x,y)(x,y) that satisfies both equations. In that case, the entire system is inconsistent.

Question 13

A system of mm linear equations in nn variables is represented by the augmented matrix [Ab][A|\mathbf{b}]. If the system is inconsistent, which of the following statements must be true?

  1. rank(A)=rank([Ab])\mathrm{rank}(A) = \mathrm{rank}([A|\mathbf{b}])
  2. rank(A)<rank([Ab])\mathrm{rank}(A) < \mathrm{rank}([A|\mathbf{b}]) (correct answer)
  3. rank(A)=n\mathrm{rank}(A) = n
  4. m>nm > n
Explanation: The Rouché–Capelli theorem states that a system of linear equations is consistent if and only if the rank of the coefficient matrix AA is equal to the rank of the augmented matrix [Ab][A|\mathbf{b}]. An inconsistent system, by definition, has no solution. This occurs precisely when the rank of the coefficient matrix is less than the rank of the augmented matrix. This situation corresponds to a row in the row-echelon form of the augmented matrix that is of the form [0,0,,0c][0, 0, \dots, 0 | c] where cc is a non-zero constant, which represents the impossible equation 0=c0=c.

Question 14

Suppose the system Ax=bA\mathbf{x} = \mathbf{b} is consistent and has more than one solution. Which of the following statements must be true?

  1. The system Ax=cA\mathbf{x} = \mathbf{c} is consistent for any vector c\mathbf{c}.
  2. The columns of matrix AA are linearly independent.
  3. The homogeneous system Ax=0A\mathbf{x} = \mathbf{0} has infinitely many solutions. (correct answer)
  4. The matrix AA must be a square matrix.
Explanation: If a non-homogeneous system Ax=bA\mathbf{x} = \mathbf{b} has more than one solution, it must have infinitely many. The general solution can be written as x=xp+xh\mathbf{x} = \mathbf{x}_p + \mathbf{x}_h, where xp\mathbf{x}_p is a particular solution to Ax=bA\mathbf{x} = \mathbf{b} and xh\mathbf{x}_h is any solution to the corresponding homogeneous system Ax=0A\mathbf{x} = \mathbf{0}. For there to be more than one solution for x\mathbf{x}, there must be non-zero solutions for xh\mathbf{x}_h. The existence of a non-trivial solution to the homogeneous system implies the existence of infinitely many solutions (any scalar multiple of xh\mathbf{x}_h is also a solution). Therefore, the homogeneous system Ax=0A\mathbf{x} = \mathbf{0} must have infinitely many solutions.

Question 15

Consider a homogeneous system of linear equations Ax=0A\mathbf{x} = \mathbf{0}, where AA is an m×nm \times n matrix. Which statement about the consistency of this system is always true?

  1. The system is consistent if and only if m=nm=n.
  2. The system is consistent if and only if the rank of AA equals nn.
  3. The system is always consistent. (correct answer)
  4. The system is inconsistent if m>nm > n.
Explanation: A homogeneous system of linear equations is a system of the form Ax=0A\mathbf{x} = \mathbf{0}. By definition, a system is consistent if it has at least one solution. The vector x=0\mathbf{x} = \mathbf{0} (the zero vector) is always a solution to any homogeneous system, because A0=0A\mathbf{0} = \mathbf{0}. This solution is called the trivial solution. Since there is always at least one solution, a homogeneous system is always consistent, regardless of the dimensions or rank of the matrix AA. The other choices describe conditions for a unique solution or are common misconceptions about systems in general.

Question 16

For what value of kk does the following system of equations have no solution? \begin{align*} x + y - z &= 1 \\ 2x + 3y + kz &= 3 \\ x + ky + 3z &= 2 \end{align*}

  1. k=3k = -3 (correct answer)
  2. k=2k = -2
  3. k=2k = 2
  4. k=3k = 3
Explanation: We can use Gaussian elimination on the augmented matrix of the system. [111123k31k32]\left[ \begin{array}{ccc|c} 1 & 1 & -1 & 1 \\ 2 & 3 & k & 3 \\ 1 & k & 3 & 2 \end{array} \right] Performing row operations R2R22R1R_2 \to R_2 - 2R_1 and R3R3R1R_3 \to R_3 - R_1 gives: [111101k+210k141]\left[ \begin{array}{ccc|c} 1 & 1 & -1 & 1 \\ 0 & 1 & k+2 & 1 \\ 0 & k-1 & 4 & 1 \end{array} \right] Next, performing R3R3(k1)R2R_3 \to R_3 - (k-1)R_2: [111101k+21004(k1)(k+2)1(k1)]\left[ \begin{array}{ccc|c} 1 & 1 & -1 & 1 \\ 0 & 1 & k+2 & 1 \\ 0 & 0 & 4 - (k-1)(k+2) & 1 - (k-1) \end{array} \right] The system has no solution if the last row represents an equation of the form 0=c0 = c where c0c \neq 0. This requires the coefficient of the third variable to be zero and the constant on the right to be non-zero. 4(k1)(k+2)=4(k2+k2)=k2k+6=(k+3)(k2)=04 - (k-1)(k+2) = 4 - (k^2+k-2) = -k^2-k+6 = -(k+3)(k-2) = 0. This occurs when k=3k=-3 or k=2k=2. The constant term is 1(k1)=2k1 - (k-1) = 2-k. This must be non-zero, so k2k \neq 2. Combining both conditions, the system is inconsistent only when k=3k=-3.

Question 17

Consider the system of equations: \begin{align*} x + 2y - z &= 1 \\ 2x + 5y - z &= 3 \\ x + 3y &= k \end{align*} For which value of kk is the system consistent?

  1. k=0k=0
  2. k=1k=1
  3. k=2k=2 (correct answer)
  4. k=3k=3
Explanation: To determine when the system is consistent, we perform Gaussian elimination on the augmented matrix. [12112513130k]\left[ \begin{array}{ccc|c} 1 & 2 & -1 & 1 \\ 2 & 5 & -1 & 3 \\ 1 & 3 & 0 & k \end{array} \right] Apply row operations R2R22R1R_2 \to R_2 - 2R_1 and R3R3R1R_3 \to R_3 - R_1: [12110111011k1]\left[ \begin{array}{ccc|c} 1 & 2 & -1 & 1 \\ 0 & 1 & 1 & 1 \\ 0 & 1 & 1 & k-1 \end{array} \right] Now apply the operation R3R3R2R_3 \to R_3 - R_2: [12110111000k2]\left[ \begin{array}{ccc|c} 1 & 2 & -1 & 1 \\ 0 & 1 & 1 & 1 \\ 0 & 0 & 0 & k-2 \end{array} \right] For the system to be consistent, the last row must not represent a contradiction. The equation from the last row is 0x+0y+0z=k20x + 0y + 0z = k-2. This equation is only true if k2=0k-2=0, which means k=2k=2. If k2k \neq 2, the last row becomes 0=c0 = c for some non-zero cc, and the system is inconsistent.