0% found this document useful (0 votes)
64 views4 pages

2085 F 17 Ps 2 A

This homework assignment involves solving systems of linear equations using Gaussian elimination. Students must show their work when solving problems. The first problem involves a 3x3 system and expressing the solution in theorem form. The second problem involves a 5x5 system and writing the general solution. The third problem analyzes a 3x3 system for different values of k that would yield a unique solution, no solution, or infinitely many solutions.

Uploaded by

michellehu69
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
64 views4 pages

2085 F 17 Ps 2 A

This homework assignment involves solving systems of linear equations using Gaussian elimination. Students must show their work when solving problems. The first problem involves a 3x3 system and expressing the solution in theorem form. The second problem involves a 5x5 system and writing the general solution. The third problem analyzes a 3x3 system for different values of k that would yield a unique solution, no solution, or infinitely many solutions.

Uploaded by

michellehu69
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Homework #2 Due: September 6

In all homework problems, it is not sufficient to show only the answers. You must show your
work.

1. Solve the linear system via Gauss-Jordan reduction. Express your answers in the form
of Theorem 3.1, Page 24 of the text.
2x + y + 3z = 1
(a) 4x + 3y + 5z = 1
6x + 5y + 5z = −3

I Solution. Use augmented matrices with Gauss-Jordan reduction:


   
2 1 3 1 2 1 3 1
−2ρ1 +ρ2
4 3 5 1 −→ 0 1 −1 −1
−3ρ1 +ρ3
 6 5 5 −3   0 21 −43 −61 
2 1 3 1 1
ρ
1 2 2 2
2 1
−→ 0 1 −1 −1 −→ 0 1 −1 −1
−2ρ2 +ρ3 − 12 ρ3
0 01 −2 −4 0 0 1 2
1 2 0 − 25

− 12 ρ2 +ρ1
1 0 0 −3
ρ3 +ρ2
−→ 0 1 0 1  −→ 0 1 0 1
− 32 ρ3 +ρ1
0 0 1 2 0 0 1 2

The last matrix is in reduced echelon form, so the solution can be read off as

(x, y, z) = (−3, 1, 2).

J
x1 + 3x2 + x3 + 5x4 + x5 = 5
(b) x2 + x3 + 2x4 + x5 = 4
2x1 + 5x2 + 7x4 + x5 = 3

I Solution. Apply Gauss-Jordan reduction to the augmented matrix:


   
1 3 1 5 1 5 1 3 1 5 1 5
−2ρ1 +ρ3
0 1 1 2 1 4 −→ 0 1 1 2 1 4
 2 5 0 7 1 3  0 −1 −2 −3 −1 −7 
1 3 1 5 1 5 1 3 0 4 1 2
ρ2 +ρ3 ρ3 +ρ2
−→ 0 1 1 2 1 4 −→ 0 1 0 1 1 1
ρ3 +ρ1
0 0 −1 −1 0 −3 0 0 −1 −1 0 −3
1 0 0 1 −2 −1
−3ρ2 +ρ1
−→ 0 1 0 1 1 1
−ρ3
0 0 1 1 0 3

Math 2085 1
Homework #2 Due: September 6

The last matrix is in reduced echelon form, which is the augmented matrix of the
linear system in reduced echelon form

x1 + x4 − 2x5 = −1
x2 + x4 + x5 = 1
x3 + x4 = 3

Thus, the leading variables are x1 , x2 and x3 , which means that the free variables
are x4 and x5 . Thus we can write the solutions as
         
x1 −1 − x4 + 2x5 −1 −1 2
x2   1 − x4 − x5   1 −1 −1
         
x3  = 
   3 − x4  =  3 + −1 x4 +  0 x5
      
x4   x4   0  1  0
x5 x5 0 0 1

where x4 and x5 can be any real numbers. The term without the parameters x4
and x5 is the particular solution with x4 = x5 = 0, whereas the linear combi-
nation with the parameters x4 and x5 is the general solution of the associated
homogeneous system. J

2. Consider the system of linear equations

x+y− z=a
(1)
x − y + 2z = b

where a and b are some real numbers.

(a) Find the general solution of the associated homogeneous equation.

I Solution. The associated homogeneous system is

x+y− z=0
x − y + 2z = 0

Solve by Gauss-Jordan reduction:


   
1 1 −1 0 −ρ1 +ρ2 1 1 −1 0
−→
1 −1 2 0 0 −2 3 0
1
 
1 1 −1 0 −ρ2 +ρ1 1 0 0
−→ −→ 2
1
− 2 ρ2 0 1 − 23 0 0 1 − 23 0

The last matrix is in reduced echelon form, which is the augmented matrix of the
following linear system in reduced echelon form

x + 12 z = 0
x2 − 23 z = 2

Math 2085 2
Homework #2 Due: September 6

The leading variables are x and y, while the remaining variable z is the only free
variable. Thus, the solution set is
   
x −1/2
y  =  3/2  z
z 1

where z can be any real number. J

(b) A particular solution of Equation (1) when a = 1 and b = 2 is (x, y, z) = (1, 1, 1).
Find the general solution of Equation (1).

I Solution. The general solution in this case is the sum of the given particular
solution and the general solution of the associated homogeneous equation. Thus,
the general solution with a = 1, b = 2 is
     
x 1 −1/2
y  = 1 +  3/2  z
z 1 1

where z is an arbitrary real number. J

(c) Find a particular solution of Equation (1) when a = −1 and b = −2.

I Solution. Just multiply a particular solution for the case a = 1, b = 2 by −1.


Thus, a particular solution is (x, y, z) = (−1, −1, −1). J

(d) Find a particular solution of Equation (1) when a = 3 and b = 6.

I Solution. Just multiply a particular solution for the case a = 1, b = 2 by 3.


Thus, a particular solution is (x, y, z) = (3, 3, 3). J

[Remark: After you have done part (a), it is possible to immediately write down the
solutions in the remaining parts. Of course, you need to explain how you got your
answers.]

3. Consider the system of linear equations

x + x + kz = 1
x + ky + z = 1 (2)
kx + y + z = 1

where k is some real number. For what value(s) of k does this system have

(a) a unique solution?


(b) no solution?
(c) infinitely many solutions?

Math 2085 3
Homework #2 Due: September 6

(Justify your assertions.)

I Solution. Use augmented matrices with Gauss reduction to reduce to echelon form:
   
1 1 k 1 1 1 k 1
−ρ1 +ρ2
 1 k 1 1 −→ 0 k − 1 1 − k 0 
−kρ1 +ρ3 2
 k 1 1 1  0 1−k 1−k 1−k
1 1 k 1
−→ 0 k − 1 1−k 0 
ρ2 +ρ3 2
0 0 2−k−k 1−k

The last matrix is in echelon form, so the system will have a unique solution if and
only if all of the variables are leading variables. This will happen so long as k − 1 6= 0
and 2 − k − k 2 6= 0. Since 2 − k − k 2 = (s + k)(1 − k) = 0 if and only if k = −2 or
k = 1, it follows that the system will have a unique solution provided k 6= −2 or 1.
 
1 1 −2 1
If k = −2 then the augmented matrix is 0 −3 3 0. Since the last row represents
0 0 0 3
the inconsistent equation 0 = 3, there will be no solutions to the system if k = −2.
 
1 1 1 1
If k = 1 then the augmented matrix is 0 0 0 . This matrix has no rows rep-
0 0 0 0
resenting an inconsistent equation, so there are solutions. Moreover, there is only one
leading variable, namely x, so there are free variables (namely, y and z). Thus, there
are infinitely many solutions to the system in case k = 1. J

Math 2085 4

You might also like