Problem Sheet 1 with Solutions

GRA 6035 Mathematics

BI Norwegian Business School

2

Problems

1. From linear system to augmented matrix

Write down the coefficient matrix and the augmented matrix of the following linear
systems:
x+ y− z=0
2x + 5y = 6
a) b) x − y + z = 2
3x − 7y = 4
x − 2y + 4z = 3

2. From augmented matrix to linear system

Write down the linear system in the variables x, y, z with augmented matrix
 
1 2 04
2 −3 1 0
7 4 13

3. Solution by substitution
Use substitution to solve the linear system

x+ y+ z=1
x− y+ z=4
x + 2y + 4z = 7

4. Variation of parameters by substitution

For what values of h does the following linear system have solutions?

x+ y+z=1
x− y+z=4
x + 2y + z = h

5. Gaussian elimination I
Solve the following linear systems by Gaussian elimination:

x+ y+ z=1 2x + 2y − z = 2
a) x− y+ z=4 b) x + y + z = −2
x + 2y + 4z = 7 2x + 4y − 3z = 0

6. Gauss-Jordan elimination
Solve the following linear system by Gauss-Jordan elimination:

x+ y+ z=1
x− y+ z=4
x + 2y + 4z = 7
 3

7. Gaussian elimination II
Solve the following linear systems by Gaussian elimination:

6x + y = 7
−4x + 6y + 4z = 4
a) b) 3x + y = 4
2x − y + z = 1
−6x − 2y = 1

8. Variation of parameters
Discuss the number of solutions of the linear system

x + 2y + 3z = 1
−x + ay − 21z = 2
3x + 7y + az = b

for all values of the parameters a and b.

9. Pivot positions
Find the pivot positions of the following matrix:
 
1 3417
 3 2 1 0 7
−1 3 2 4 9

10. Basic and free variables

Show that the following linear system has infinitely many solutions, and determine
the number of degrees of freedom:

x + 6y − 7z + 3w = 1
x + 9y − 6z + 4w = 2
x + 3y − 8z + 4w = 5

Find free variables and express the basic variables in terms of the free ones.

11. Linear Systems

Solve the following linear systems by substitution and by Gaussian elimination:

x − 3y + 6z = −1 x+ y+ z= 0
a) 2x − 5y + 10z = 0 b) 12x + 2y − 3z = 5
3x − 8y + 17z = 1 3x + 4y + z = −4

12. Rank of a matrix I

Find the rank of the following matrices:
 
    1 2 −1 3
1 2 134  2 4 −4 7 
a) b) c)
8 16 201
−1 −2 −1 −2
4

13. Rank of a matrix II

Find the rank of the following matrices:
 
    1 −2 −1 1
1 3 0 0 2 13 7 2 1 1 2
(a) 2 4 0 −1 b) −1 4 3 1  c)  
−1 1 −1 −3
1 −1 2 2 3 2 5 11
−2 −5 −2 0

14. Homogeneous linear systems

Prove that any 4 × 6 homogeneous linear system has non-trivial solutions.

15. Linear system vith parameters

Discuss the ranks of the coefficient matrix A and the augmented matrix  of the
linear system
x1 + x2 + x3 = 2q
2x1 − 3x2 + 2x3 = 4q
3x1 − 2x2 + px3 = q
for all values of p and q. Use this to determine the number of solutions of the linear
system for all values of p and q.

16. Midterm Exam in GRA6035 24/09/2010, Problem 3

Compute the rank of the matrix
 
2 5 −3 −4 8
A = 4 7 −4 −3 9
6 9 −5 −2 4

17. Mock Midterm Exam in GRA6035 09/2010, Problem 3

Compute the rank of the matrix
 
1 2 −5 0 −1
 2 5 −8 4 3 
A= −3 −9 9 −7 −2


3 10 −7 11 7

18. Midterm Exam in GRA6035 24/05/2011, Problem 3

Compute the rank of the matrix
 
2 10 6 8
A = 1 5 4 11 
3 15 7 −2
 5

Solutions

General remark: In some of the problems, we compute an echelon form. Since the
echelon form is not unique, it is possible to get to another echelon form than the one
indicated in the solutions below. However, the pivot positions should be the same.
1 From linear system to augmented matrix
The coefficient matrix and the augmented matrix of the system is given by
   
    1 1 −1 1 1 −1 0
2 5 2 5 6
a) , b) 1 −1 1  , 1 −1 1 2
3 −7 3 −7 4
1 −2 4 1 −2 4 3

2 From augmented matrix to linear system

The linear system is given by

x + 2y =4
2x − 3y + z = 0
7x + 4y + z = 3

3 Solution by substitution
We solve the linear system
x+ y+ z=1
x− y+ z=4
x + 2y + 4z = 7
by substitution. First, we solve the first equation for z and get z = 1 − x − y. Then
we substitute this expression for z in the last two equations. We get

− 2y = 3
−3x − 2y = 3

We solve the first equation for y, and get y = −1.5. Then we substitute this value for
y in the second equation, and get x = 0. Finally, we substitute both these values in
z = 1 − x − y and get z = 2.5. The solution is therefore x = 0, y = −1.5, z = 2.5.
4 Variation of parameters by substitution
We solve the linear system
x+ y+z=1
x− y+z=4
x + 2y + z = h
by substitution. First, we solve the first equation for z and get z = 1 − x − y. Then
we substitute this expression for z in the last two equations. We get

− 2y = 3
y = h−1
6

We solve the first equation for y, and get y = −1.5. Then we substitute this value
for y in the second equation, and get −1.5 = h − 1. If h = −0.5, this holds and the
system have solutions (x is a free variable, y = −1.5 and z = 1 − x − y = 2.5 − x).
If h 6= −0.5, then this leads to a contradiction and the system have no solutions.
Therefore, the linear system have solutions if and only if h = −0.5.
5 Gaussian elimination I
The linear systems have the following augmented matrices:
   
1 1 11 2 2 −1 2
a) 1 −1 1 4 b) 1 1 1 −2
1 2 47 2 4 −3 0

a) To solve the system, we reduce the system to an echelon form using elementary
row operations. The row operations are indicated.
 
1 1 11
1 −1 1 4 R2 ← R2 + (−1)R1
1 2 47 R3 ← R3 + (−1)R1
 
1 1 11
⇒ 0 −2 0 3
0 1 36 R3 ← R3 + (0.5)R2
 
1 1 1 1
⇒ 0 −2 0 3
0 0 3 7.5

From the last equation we get z = 2.5, substitution in the second equation gives
y = −1.5, and substitution in the first equation gives x = 0. Therefore, the solution
of a) is x = 0, y = −1.5, z = 2.5.
b) To solve the system, we reduce the system to an echelon form using elementary
row operations. The row operations are indicated.
 
2 2 −1 2
1 1 1 −2 R2 ← R2 + (−0.5)R1
2 4 −3 0 R3 ← R3 + (−1)R1
 
2 2 −1 2
⇒ 0 0 1.5 −3 R2 ← R3
0 2 −2 −2 R3 ← R2
 
2 2 −1 2
⇒ 0 2 −2 −2
0 0 1.5 −3

From the last equation we get z = −2, substitution in the second equation gives
y = −3, and substitution in the first equation gives x = 3. Therefore, the solution of
b) is x = 3, y = −3, z = −2.
 7

6 Gauss-Jordan elimination
We reduce the system to the reduced echelon form using elementary row operations:
 
1 1 11
1 −1 1 4 R2 ← R2 + (−1)R1
1 2 47 R3 ← R3 + (−1)R1
 
1 1 11
⇒ 0 −2 0 3
0 1 36 R3 ← R3 + (0.5)R2
 
1 1 1 1
⇒ 0 −2 0 3 R2 ← (−1/2) · R2
0 0 3 7.5 R3 ← (1/3) · R3
R1 ← R1 + (−1)R2 + (−1)R3
 
111 1
⇒ 0 1 0 −1.5
 
0 0 1 2.5
 
100 0
⇒ 0 1 0 −1.5
0 0 1 2.5

We read off the solution of the system: x = 0, y = −1.5, z = 2.5.

7 Gaussian elimination II
a) We reduce the linear system to an echelon form:
   
−4 6 4 4 −4 6 4 4
⇒
2 −1 1 1 0 233

We see that the system has infinitely many solutions (z is a free variable and x, y are
basic variables). We reduce the system to a reduced echelon form:
     
−4 6 4 4 1 −1.5 −1 −1 1 0 1.25 1.25
⇒ ⇒
0 233 0 1 1.5 1.5 0 1 1.5 1.5

We see that x + 1.25z = 1.25, y + 1.5z = 1.5. Therefore the solution is given by
x = 1.25 − 1.25z, y = 1.5 − 1.5z (z is a free variable).
b) We reduce the linear system to an echelon form:
     
6 1 7 6 1 7 6 1 7
 3 1 4 ⇒ 0 0.5 0.5 ⇒ 0 0.5 0.5
−6 −2 1 0 −1 8 0 0 9

We see that the system has no solutions.

8

8 Variation of parameters
We find the augmented matrix of the linear system and reduce it to an echelon form:
   
1 2 3 1 1 2 3 1
−1 a −21 2 ⇒ 0 a + 2 −18 3
3 7 a b 0 1 a−9 b−3

We interchange the last two rows to avoid division with a + 2:

   
1 2 3 1 12 3 1
0 1 a − 9 b − 3 ⇒ 0 1 a−9 b − 3
0 a + 2 −18 3 0 0 −18 − (a − 9)(a + 2) 3 − (b − 3)(a + 2)

We compute −18 − (a − 9)(a + 2) = 7a − a2 . So when a 6= 0 and a 6= 7, the system

has a unique solution. When a = 0, we compute 3 − (b − 3)(a + 2) = 9 − 2b. So
when a = 0 and b 6= 9/2, the system is inconsistent, and when a = 0, b = 9/2,
the system has infinitely many solutions (one degree of freedom). When a = 7, we
compute 3 − (b − 3)(a + 2) = 30 − 9b. So when a = 7 and b 6= 30/9 = 10/3, the
system is inconsistent, and when a = 7, b = 10/3, the system has infinitely many
solutions (one degree of freedom).
9 Pivot positions
We redude the matrix to an echelon form using row elementary row operations:
     
1 3417 1 3 4 1 7 1 3 4 1 7
 3 2 1 0 7 ⇒ 0 −7 −11 −3 −14 ⇒ 0 −7 −11 −3 −14
−1 3 2 4 9 0 6 6 5 16 0 0 −24/7 ∗ ∗

We have not computed the entries marked ∗ since they are not needed to find the
pivot positions. The pivot positions in the matrix are marked with a box:
 
1 3 4 17
 3 2 1 0 7
 
−1 3 2 4 9

10 Basic and free variables

We find the augmented matrix and reduce it to an echelon form using elementary
row operations:
     
1 6 −7 3 1 1 6 −7 3 1 1 6 −7 3 1
1 9 −6 4 2 ⇒ 0 3 1 1 1 ⇒ 0 3 1 1 1
1 3 −8 4 5 0 −3 −1 1 4 00 0 25

We see that the system has infinitely many solutions and one degree of freedom (z
is a free variable and x, y, w are basic variables). To express x, y, w in terms of z, we
find the reduced echelon form:
 9
     
1 6 −7 3 1 1 6 −7 3 1 1 0 −9 0 −7/2
0 3 1 1 1 ⇒ 0 1 1/3 1/3 1/3 ⇒ 0 1 1/3 0 −1/2
00 0 25 0 0 0 1 5/2 0 0 0 1 5/2

We see that x − 9z = −7/2, y + z/3 = −1/2 and w = 5/2. This means that the
solution is given by x = 9z − 7/2, y = −z/3 − 1/2, w = 5/2 (z is a free variable).
11 Linear Systems
a) We find the augmented matrix of the linear system and reduce it to an echelon
form:    
1 −3 6 −1 1 −3 6 −1
2 −5 10 0 ⇒ 0 1 −2 2
3 −8 17 1 0 0 1 2
Back substitution gives the solution x = 5, y = 6, z = 2.
b) We find the augmented matrix of the linear system and reduce it to an echelon
form:    
1 1 1 0 11 1 0
12 2 −3 5 ⇒ 0 1 −2 −4
3 4 1 −4 0 0 −35 −35
Back substitution gives the solution x = 1, y = −2, z = 1.
12 Rank of a matrix I
a) We find an echelon form of the matrix:
   
1 2 12
⇒
8 16 00

We see that the rank of A is 1 since there is one pivot position.

b) We find an echelon form of the matrix:
   
134 1 3 4
⇒
201 0 −6 −7

We see that the rank of A is 2 since there are two pivot positions.
c) We find an echelon form of the matrix:
     
1 2 −1 3 1 2 −1 3 1 2 −1 3
 2 4 −4 7  ⇒ 0 0 −2 1 ⇒ 0 0 −2 1
−1 −2 −1 −2 0 0 −2 1 00 0 0

We see that the rank of A is 2 since there are two pivot positions.
13 Rank of a matrix II
a) We find an echelon form of the matrix:
     
1 3 0 0 1 3 0 0 1 3 0 0
2 4 0 −1 ⇒ 0 −2 0 −1 ⇒ 0 −2 0 −1
1 −1 2 2 0 −4 2 2 0 0 2 4
10

We see that the rank of A is 3 by counting pivot positions.

b) We find an echelon form of the matrix:
     
2 13 7 2 1 3 7 2 1 3 7
−1 4 3 1  ⇒ 0 4.5 4.5 4.5 ⇒ 0 4.5 4.5 4.5
3 2 5 11 0 0.5 0.5 0.5 0 0 0 0

We see that the rank of A is 2 by counting pivot positions.

c) We find an echelon form of the matrix:
   
1 −2 −1 1 1 −2 −1 1
2 1 1 2 0 5 3 0 
−1 1 −1 −3 ⇒ 0 −1 −2 −2
   

−2 −5 −2 0 0 −9 −4 2

We interchange the two middle rows to get easier computations:

     
1 −2 −1 1 1 −2 −1 1 1 −2 −1 1
0 −1 −2 −2 0 −1 −2 −2  0 −1 −2 −2 
0 5 3 0  ⇒ 0 0 −7 −10 ⇒ 0 0 −7 −10
     

0 −9 −4 2 0 0 14 20 0 0 0 0

We see that the rank of A is 3 by counting pivot positions. T

14 Homogeneous linear systems
Let A be the 4 × 6 coefficient matrix of the homogeneous linear system. Then n = 6
(there are 6 variables) while rk A ≤ 4 (there cannot be more than one pivot position
in each row). So there are at least two degrees of freedom, and the system has non-
trivial solutions.
15 Linear system with parameters
We find the coefficient matrix A and the augmented matrix  of the system:
   
1 1 1 1 1 1 2q
A = 2 −3 2  , Â = 2 −3 2 4q
3 −2 p 3 −2 p q

Then we compute an echelon form of  (which contains an echelon form of A as the

first three columns):
   
1 1 1 2q 1 1 1 2q
 = 2 −3 2 4q ⇒ 0 −5 0 0 
3 −2 p q 0 0 p − 3 −5q

By counting pivot positions, we see that the ranks are given by

( (
3 p 6= 3 3 p 6= 3 or q 6= 0
rk A = rk  =
2 p=3 2 p = 3 and q = 0
 11

The linear system has one solution if p 6= 3, no solutions if p = 3 and q 6= 0, and

infinitely many solutions (one degree of freedom) if p = 3 and q = 0.
16 Midterm Exam in GRA6035 24/09/2010, Problem 3
We compute an echelon form of A using elementary row operations, and get
   
2 5 −3 −4 8 2 5 −3 −4 8
A = 4 7 −4 −3 9 99K 0 −3 2 5 7 
6 9 −5 −2 4 0 0 0 0 −6

Hence A has rank 3.

17 Mock Midterm Exam in GRA6035 09/2010, Problem 3
We compute an echelon form of A using elementary row operations, and get
   
1 2 −5 0 −1 1 2 −5 0 −1
 2 5 −8 4 3  0 1 2 4 5 
A= −3 −9 9 −7 −2 99K 0 0 0 5 10 
  

3 10 −7 11 7 00 0 0 0

Hence A has rank 3.

18 Midterm Exam in GRA6035 24/05/2011, Problem 3
We compute an echelon form of A using elementary row operations, and get
   
2 10 6 8 1 5 4 11
A = 1 5 4 11  99K 0 0 1 7 
3 15 7 −2 000 0

Hence A has rank 2.