IC114-Linear Algebra

Tutorial Sheet-1
Even Semester (2023–24)

(I). Elementary row operations:

(a) Multiply a row through by a nonzero constant.
(b) Interchange two rows.
(c) Add a multiple of one row to another row.
(II). Row-echelon form:
(a) If a row does not consist entirely of zeros, then the first nonzero number in the row is a 1. We call this a
leading 1.
(b) If there are any rows that consist entirely of zeros, then they are grouped together at the bottom of the
matrix.
(c) In any two successive rows that do not consist entirely of zeros, the leading 1 in the lower row occurs
farther to the right than the leading 1 in the higher row.
(III). Reduced row-echelon form:
(a) If a row does not consist entirely of zeros, then the first nonzero number in the row is a 1. We call this a
leading 1.
(b) If there are any rows that consist entirely of zeros, then they are grouped together at the bottom of the
matrix.
(c) In any two successive rows that do not consist entirely of zeros, the leading 1 in the lower row occurs
farther to the right than the leading 1 in the higher row.
(d) Each column that contains a leading 1 has zeros everywhere else in that column.
1. Which of the following equations is linear?
(a) x1 + 3x2 + x1 x3 = 2
(b) x2 = sin(x1 )
1
(c) x1 = x2 + 3x3 + 10.
2
Solution:
(a) Not linear because of the term x1 x3 .
(b) Not linear because of the term sin(x1 ).
(c) Linear.
2. Find the augmented matrix for each of the following systems.
x1 − 4x3 = −5 −3x1 + 2x3 = 2 2x1 + 5x2 + 2x3 = −3
(a) x1 + 2x2 + x3 = 0 (b) 7x1 − x2 − 2x3 = −1 (c) 3x1 − 2x2 + 4x3 = 1
−x1 + x2 + x3 = −1. x1 + 6x2 − x3 = −1. −x1 + x2 − 2x3 = −2.
Solution:
(a) The augmented matrix for the system of linear equations is
 
1 0 −4 −5
[A|B] =  1 2 1 0 
−1 1 1 −1
(b) same as (a).
(c) same as (a).

1
3. Find the system of equations from the following augmented 
matrix. 
    1 2 −3 1 2 4
1 2 −4 1 2 1 2 −3 1  2 4 −4 6 10 2 
(a)  2 9 −12 6 8  (b)  2 4 −4 6  (c)  3 6 −6 9 13
.
6 
7 6 −3 9 18 3 6 −6 9
2 3 0 8 2 9

Solution:
(a)The system of equations of this augmented matrix are

x1 + 2x2 − 4x3 + x4 = 2
2x1 + 9x2 − 12x3 + 6x4 = 8
7x1 + 6x2 − 3x3 + 9x4 = 18

(b) Same as Part (a)

(c) Same as Part (a).
4. A boy is walks along the path y = ax2 + bx + c through the points (−6, 8), (−2, −12) and (3, 8) and hope to
meet his friend at P (7, 60). Will they meet?

Solution: We are given y = ax2 + bx + c. Also we are given (−6, 8), (−2, −12) and (3, 8) are points on the
path. (−6, 8) is a point on y = ax2 + bx + c at x = −6, y = 8. So,

36a–6b + c = 8

(−2, −12) is a point on y = ax2 + bx + c at x = −2, y = −12. So,

4a–2b + c = −12

(−2, −12) is a point on y = ax2 + bx + c at x = −2, y = −12. So,

9a + 3b + c = 8.

Now the matrix form of the above three equations is

    
36 −6 1 a 8
 4 −2 1   b  =  −12 
9 3 1 c 8

(i.e. AX=B). The augmented matrix for the system of linear equation (1)-(3) is
 
36 −6 1 8
[A|B] =  4 −2 1 −12 
9 3 1 8

Reduce this matrix into a row-echelon form

 
36 −6 1 8
R ←→4R3 −R1
[A|B] −−3−−−−−− −−→  0 −12 8 −116 
R2 ←→9R2 −R1
0 18 3 24
 
36 −6 1 8
R ←→2R +3R2
−−3−−−−−3−−−→  0 −12 8 −116 .
0 0 30 −300

The system corresponding to this matrix is

36a − 6b + c = 8
−12b + 8c = −116
30c = −300.

Solving for the leading variables yields a = 1, b = 3 and c = −10. We can calculate the value of y by using
the equation y = x2 + 3x − 10. Now at x = 7, y = (7)2 + 3(7) − 10 = 49 + 21–10 = 60. Hence, (7, 60) is a
point on the path so he will meet his friend.

2
5. If a quadratic equation ax2 + bx + c is divided by three linear factors x + 3, x − 5 and x − 1, the remainders
are 21, 61 and 9 respectively. Find the values of a, b and c.

Solution: Let P (x) = ax2 + bx + c. When a polynomial function P (x) is divided by three linear factors x + 3,
x − 5, and x − 1, the corresponding remainders are P (−3), P (5) and P (1), respectively. We are given that
P (−3) = 21, P (5) = 61, P (1) = 9. So,
9a − 3b + c = 21 (1)
25a + 5b + c = 61 (2)
a+b+c=9 (3)
Now the matrix form of the above three equations is
    
9 −3 1 a 21
 25 5 1   b  =  61 
1 1 1 c 9
(i.e. AX=B). The augmented matrix for the system of linear equation (1)-(3) is
 
9 −3 1 21
[A|B] =  25 5 1 61 
1 1 1 9
Reduce this matrix into a row-echelon form
 
1 1 1 9
R ←→R3
[A|B] −−1−−−−→  25 5 1 61 
9 −3 1 21
 
1 1 1 9
R ←→R3 −9R1
−−3−−−−− −−−→  0 −20 −24 −164 
R2 ←→R2 −25R1
0 −12 −8 −60
 
1 1 1 9
R ←→−R3
−−3−−−−−→  0 −20 −24 −164 
0 12 8 60
 
1 1 1 9
R ←→5R +3R2
−−3−−−−−3−−−→  0 −20 −24 −164 .
0 0 −32 −192
The system corresponding to this matrix is
a+b+c = 9
−20b − 24c = −164
−32c = −192.
Solving for the leading variables yields a = 2, b = 1 and c = 6.
6. For what values of k, this system of the equation has no solution
(3k + 1)x1 + 3x2 = 2
2
(k + 1)x1 − (k − 2)x2 = 5.
Solution: First, we write the system of linear equations into the augmented matrix.
 
(3k + 1) 3 2
A=
k 2 + 1 −(k − 2) 5
Now, we apply elementary row operations as follows:
 
R2 ←→(3k+1)R2 −(k2 +1)R1 (3k + 1) 3 2
[A|B] −−−−−−−−−−−−−−−−−−→
0 −(6k 2 − 5k + 1) −2k 2 + 15k + 3
2
6k 2 + 35k + 11
 
R1 ←→(2k−1)(3k−1)R1 +3R2 (2k − 1)(9k − 1) 0
−−−−−−−−−−−−−−−−−−−→
0 −(2k − 1)(3k − 1) −2k 2 + 15k + 3
Now, for the no solution, a22 must be equal to 0, whereas a23 must not be equal to 0 (as rank(A) ̸= rank(A|b)).
So, for a22 = 0 implies k = 21 or 13 . And also, for k = 12 , 13 , a23 ̸= 0. So, for k = 21 , 13 this system of linear
equations has no solution. (amn means m-th row and n-th column element)

3
7. Use the elementary row operations to solve the following systems of linear equations:
2x1 + 4x3 = 5 3x1 − 9x3 = 33 2x1 + 5x2 + 2x3 = −38
(a) x1 − x2 + 3x3 = 0 (b) 7x1 − 4x2 − x3 = −15 (c) 3x1 − 2x2 + 4x3 = 17
−x1 + 3x2 + 7x3 = −2. 4x1 + 6x2 + 5x3 = −6. −6x1 + x2 − 7x3 = −12.
Solution:
(a) The augmented matrix of the given system of linear equations is
 
2 0 4 5
[A|B] =  1 −1 3 0 
−1 3 7 −2

Now, we apply elementary row operations as follows:

   
2 0 4 5 2 0 4 5
R →2R3 +R1 R →2R +3R2
[A|B] −−3−−−− −−→  0 −4 2 −5  −−3−−−−3−−−→  0 −4 2 −5 .
R2 →2R2 −R1
0 6 18 1 0 0 42 −13

The system corresponding to this matrix is

2x1 + 4x3 = 5
−4x2 + 2x3 = −5
42x3 = −13

Solving for the leading variables yields

5 4
x1 = − x3
2 2
5 2
x2 = + x3
4 4
−13
x3 = .
42
After solving these equations, we get x3 = −13 23
42 , x2 = 21 , and x1 =
131
42 . Therefore, the solution of the given
131 23 −13
system of linear equations is (x1 , x2 , x3 ) = ( 42 , 21 , 42 ).
(b) Same as part (a).
(c) Same as part (a).
8. Use the reduced row-echelon form (RREF) to solve the following system of linear equations. Also, find the
leading 1 and free variables.
3x1 + x2 − 4x3 = −1 3x1 + 3x2 − 4x3 = −1
3x + 8y = 5
(a) x1 + 10x3 = 5 (b) (c) 7x1 + 10x3 = 5
4x + 11y = 7
4x1 + x2 + 6x3 = 1. 4x1 + 11x2 + 6x3 = 6.
Solution:
(a) First we write the augmented matrix
1 −4 −1
   
3 1 −4 −1 1
R3 ←→ 4 R3
1 3 3 3
[A|B] =  1 0 10 5  −−−−−− −→  1 0 10 5 
R1 ←→ 31 R1
4 1 6 1 1 14 6
4
1
4
−4 −1
1 13
 
R ←→R3 −R1 3 3
−−3−−−−− −−→  0 −1 3
34
3
16 
3
R2 ←→R2 −R1 −1 17 7
0 12 6 12
−4 −1
1 31
 
R ←→4R3 −R2 3 3
−−3−−−−−− −−→  0 −1 3
34
3
16 
3
0 0 0 −3

So, A33 position is 0, but A34 position is not equal to 0 i.e., rank(A) ̸= rank(A|b). So, this system of equations
has no solution.

4
 (b) First, we write the augmented matrix
8 5
   
3 8 5 R2 ←→ 41 R2 1
[A|B] = −−−−−− −→ 3
11
3
7
4 11 7 1
R1 ←→ 3 R1 1 4 4
8 5
 
R2 ←→R2 −R1 1
−−−−−−−−−→ 3
1
3
1
0 12 12
8 5
 
R2 ←→12R2 1
−−−−−−−→ 3 3
0 1 1
 
R1 ←→R1 −R2 1 0 −1
−−−−−−−−−→
0 1 1

Therefore, the solution is (−1, 1).

(c) Same as Part (a) or (b).
9. Use the Gauss elimination method to solve the following systems of linear equations. Also, find the leading 1
and free variables.
2x1 + 2x2 + 2x3 = 0 x1 − 2x2 − 6x3 = 5 x1 + 4x2 − x3 = −5
(a) −2x1 + 5x2 + 2x3 = 1 (b) 2x1 + 4x2 + 12x3 = −6 (c) x1 + x2 − 6x3 = −12
8x1 + x2 + 4x3 = −1. x1 − 4x2 − 12x3 = 9. 3x1 − x2 − x3 = 4.
3x1 + 4x2 − x3 = −6
(d) −2x2 + 10x3 = −8
4x2 − 2x3 = −2.

Solution:
(a) The augmented matrix of the system of linear equations is
 
2 2 2 0
[A|B] =  −2 5 2 1 
8 1 4 −1

Reduce this matrix into a row-echelon form

 
R1 ←→ 12 R1
1 1 1 0
[A|B] −−−−−−−→  −2 5 2 1 
8 1 4 −1
 
1 1 1 0
R ←→R2 +2R1
−−2−−−−− −−−→  0 7 4 1 
R3 ←→R3 −8R1
0 −7 −4 −1
 
R2 ←→ 71 R2
1 1 1 0
4 1 
−−−−−−−→  0 1 7 7
0 −7 −4 −1
 
1 1 1 0
R ←→R3 +7R2
−−3−−−−− −−−→  0 1 47 17 .
0 0 0 0

The system corresponding to this matrix is

x1 + x2 + x3 = 0
4 1
x2 + x3 =
7 7
Solving for the leading variables yields

x1 = −x2 − x3
4 1
x2 = − x3 +
7 7
x3 = t(f ree)

By using the back-substitution method, the system of linear equations has infinitely many solutions as
(x1 , x2 , x3 ) = ( −3t−1
7 , −4t+1
7 , t).

5
 (b) The augmented matrix of the given system of linear equations is
 
1 −2 −6 5
[A|B] =  2 4 12 −6 
1 −4 −12 9

Now, we apply row operation to reduce matrix A into a

reduced row-echelon form
 
1 −2 −6 5
R3 →R3 −R1
[A|B] −−−−−−−−→  0 8 24 −16 
R2 →R2 −2R1
0 −2 −6 4
 
1−2 −6 5
R3 →−R3 /2
−−−−−−−→  0 1 3 −2 
R2 →R2 /8
0 1 3 −2
 
1 0 0 1
R3 →R3 −R2
−−−−−−−−→  0 1 3 −2 
R1 →R1 +2R2
0 0 0 0

The system corresponding to this matrix is

x1 = 1
x2 + 3x3 = −2
x3 = t(f ree)

where t ∈ R. After solving these equations, we get x1 = 1, x2 = −2 − 3t, x3 = t. This means there are an
infinite number of solutions to the given system of linear equations.
(c) Same as Parts (a) or (b).
(d) Same as Parts (a) or (b).

10. Use the Gauss-Jordan elimination method to solve the following system of linear equations. Also, find the
leading 1 and free variables.
x1 + 2x2 + x3 − x4 = 1
−x1 + x2 − x3 + x5 = 0 2x1 + 2x2 + 2x3 = 0 3x1 + 5x3 = 0
(a) −x2 + 2x3 − x5 = 1 (b) −2x1 + 5x2 + 2x3 = 1 (c) 2x2 + 4x3 = 1
x1 + x2 + x3 + x4 + x5 = 1 8x1 + x2 + 4x3 = −1 x1 + 9x2 = −1.
x1 + x2 + x4 = 0
Solution:
(a) The augmented matrix of the given system of linear equations is
 
1 2 1 −1 0 1
 −1 1 −1 0 1 0 
 
[A|B] =  0 −1 2 0 −1 1 

 1 1 1 1 1 1 
1 1 0 1 0 0

6
 Reduce this matrix to a reduced row-echelon form as follows:
 
1 2 1 −1 0 1
 0 3 0 −1 1 1 
R2 ←→R2 +R1 ,R4 ←→R4 −R1  
[A|B] −−−−−−−−−−−−−−−−−−→  0 −1 2 0 −1 1 
R5 ←→R5 −R1 
 0 1 1 1

1 1 
0 1 0 1 0 0
 
1 2 1 −1 0 1
R2 ←→ 13 R2 
 0 1 0 −1 3
1
3
1 
3 
−−−−−−−→   0 −1 2 0 −1 1 

 0 1 1 1 1 1 
0 1 0 1 0 0
1 0 1 −1 −2 1
 
3 3 3
 0 1 0 −1 1 1 
R1 ←→R1 −2R2 ,R3 ←→R3 +R2  3 3 3 
−1 −2 4 
−−−−−−−−−−−−−−−−−−−→  0 0 2 3 3 3 
R4 ←→R4 −R2 ,R5 ←→R5 −R2   4 2 2 
0 0 1 3 3 3
4 −1 −1
0 0 0 3 3
 3
1 0 1 −1 −2 1

3 3 3
 0 1 0 −1 1 1 
1
R3 ←→ 2 R3 3 3 3 
−1 −1
 2 
−−−−−−−→   0 0 1 46 3 3 
 0 0 1 2 2 
3 3 3
4 −1 −1
0 0 0 3 3 3
1 0 0 −1 −1 −1
 
6 3 3
 0 1 0 −1 1 1 
R1 ←→R1 −R3  3 3 3 
−1 −1 2 
−−−−−−−−−→  0 0 1 6 3 3 
R4 ←→R4 −R3   3
0 0 0 2 1 0 
−1 −1
0 0 0 34 3 3
1 0 0 −1 −1 −1
 
6 3 3
 0 1 0 −1 1 1 
R4 ←→ 32 R4  3 3 3 
−1 −1 2 
−−−−−−−→   0 0 1 6 3 3 
 0 0 0 1 2
3 0 
−1 −1
0 0 0 43 3 3
1 0 0 0 −2 −1
 
9 3
 0 1 0 0 5 1 
R1 ←→R1 + 61 R4 ,R2 ←→R2 + 13 R4  9 3 
−2 2 
−−−−−−−−− − − −− − − −− −−− −→  0 0 1 0
9 3 
R3 ←→R3 + 31 R4 ,R5 ←→R5 − 43 R4 
 2
0 0 0 1 3 0 
0 0 0 0 −11 9
−1
3
1 0 0 0 −2 −1
 
9 3
−9
 0 1 0 0 5 1 
R5 ←→ 11 R5 9 3 
−2
 2 
−−−−−−−−→   0 0 1 0 92 3 
 0 0 0 1 0 
3
3
0 0 0 0 1 11
1 0 0 0 0 −3
 
11
 0 1 0 0 0 2 
R1 ←→R1 + 29 R5 ,R2 ←→R2 − 95 R5  11 
−−−−−−−−− − − −− − −− −−− − −→  0 0 1 0 0 24 
33 
R3 ←→R3 + 29 R5 ,R4 ←→R4 − 32 R5 
 2 
0 0 0 1 0 11
3
0 0 0 0 1 11

The corresponding system of equations is x1 = −3 2 24 2 3

11 , x2 = 11 , x3 = 33 , x4 = 11 , and x5 = 11 . Therefore, the
−3 2 24 2 3
general solution of the system of linear equations is (x1 , x2 , x3 , x4 , x5 ) = ( 11 , 11 , 33 , 11 , 11 ).
(b) Same as Part (a).
(c) Same as Part (a).
11. Solve the given system of linear equations by using the inverse of the matrix.
2x1 − x2 + 3x3 = 9 x1 − x2 + x3 = 4 2x1 + 3x2 − x3 = 9
(a) x1 + x2 + x3 = 6 (b) 2x1 + x2 − 3x3 = 0 (c) x1 + x2 + x3 = 9
x1 − x2 + x3 = 2. x1 + x2 + x3 = 2. 3x1 − x2 − x3 = −1.

7
Solution:
(a) The matrix representation of the given system of linear equations is AX = B that is
    
2 −1 3 x1 9
 1 1 1   x2  =  6 
1 −1 1 x3 2
Where,      
2 −1 3 x1 9
A =  1 1 1  , X =  x2  , B =  6 
1 −1 1 x3 2
represent the coefficient matrix, variable matrix and constant matrix respectively. Firstly, we need to calculate
A−1 . Now,
   
2 −1 3 1 0 0 1 1 1 0 1 0
R1 ←→R2
[A|I] =  1 1 1 0 1 0  −−−−−−→  2 −1 3 1 0 0 
1 −1 1 0 0 1 1 −1 1 0 0 1
 
1 1 1 0 1 0
R3 ←→R3 −R1
−−−−−−−−−−→  0 −3 1 1 −2 0 
R2 ←→R2 −2R1
0 −2 0 0 −1 1
 
1 1 1 0 1 0
R2 ←→R2 −R3
−−−−−−−−−→  0 −1 1 1 −1 −1 
0 −2 0 0 −1 1
 
1 1 1 0 1 0
R2 ←→−R2
−−−−−−−→  0 1 −1 −1 1 1 
0 −2 0 0 −1 1
 
1 0 2 1 0 −1
R3 ←→R3 +2R2
−−−−−−−−−−→  0 1 −1 −1 1 1 
R1 ←→R1 −R2
0 0 −2 −2 1 3
 
1 0 0 −1 1 2
R1 ←→R1 +R3
−−−−−−−−−→  0 1 −1 −1 1 1 
0 0 −2 −2 1 3
−1 
1 0 0 −1 1 2

R3 ←→ R3
−−−−−−− 2−−→  0 1 −1 −1 1 1 
−1 −3
 
0 0 1 1
2 2
1 0 0 −1 1 2
 

R ←→R2 +R3 
1 −1 
−−2−−−−− −−→  0 1 0 0
2 2 .

−1 −3

0 0 1 1
2 2
Therefore,
−1 1 2
 
1 −1 
A−1 =  0

2 2 

−1 −3

1
2 2
For solving the system of equations AX = B, multiply both sides by A−1 . This will give the solution for X,
which is X = A−1 B.
X = A−1 B
−1 1 2 
 

1 −1  9
0

X= 2 2  6
 
−1 −3

1 2
    2 2
x1 1
x2  = 2 
x3 3

8
 Hence, x1 = 1, x2 = 2 and x3 = 3 is the solution of the given system of linear equations.
(b) Same as Part (a).
(c) Same as Part (a).
12. Find the row-echelon form and reduced row-echelon form of the following matrices. Also, find the leading 1
and free variables.  
  0 −3 6 4 9
  1 2 3 4
1 2 −3 1 2  2 5 6 8 
 −1 −2 −1
 3 1 
(a)  2 4 −4 6 10  (b) 
  (c)  −2 −3
 0 3 −1  .
5 11 15 22 
3 6 −6 9 13  1 4 5 −9 −7 
2 2 15 23
0 2 5 −6 −6

Solution:
(a) First, we write the augmented matrix and the apply the elementary row operations to get the row-echelon
form as follows:
   
1 2 −3 1 2 1 2 −3 1 2
R2 ←→−2R1 +R2
 2 4 −4 6 10  −−−−−−−−−−−→  0 0 2 4 6 ,
R3 ←→ −3
2 R2 +R3
3 6 −6 9 13 0 0 0 0 −2

which is in row-echelon form. Now, to reduce it to the reduced roe-echelon form, we apply the following
operations:
   
1 2 −3 1 0 1 2 0 7 0
R ←→−6R3 −R2 R ←→3R2 −R1
−−2−−−−−−1
−−−−→  0 0 2 4 0  −−1−−−−−− −−→  0 0 1 2 0 .
R3 ←→ 2 R3 R2 ←→ −1
2 R2
0 0 0 0 1 0 0 0 0 1

Hence, the last matrix is the reduced row-echelon form.

(b) Same as Part (a).

(c) Same as Part (a).
13. For what values of α the following linear system have
(i) Unique solution
(ii) No solution
(iii) Infinitely many solutions

x1 + 3x2 + αx3 = 4
2x1 − x2 + 2αx3 = 1
αx1 + 5x2 + x3 = 6
Use the smallest positive integer value of α to get the unique solution of the system (Use Gauss elimination
method).
Solution: The augmented matrix of the system of linear equations is
 
1 3 α 4
[A|B] =  2 −1 2α 1 
α 5 1 6

Reduce this matrix into a row-echelon form

 
1 3 α 4
R ←→R3 −αR1
[A|B] −−3−−−−−−−−→  −0 −7 0 −7 
R2 ←→R2 −2R1
0 5 − 3α 1 − 2α 6 − 4α
 
5−3α
R3 ←→R3 + 7 R2
1 3 α 4
−−−−−−−−−− −−→  0 −7 0 −7 .
0 0 1 − α2 1 − α

Clearly, if 1 − α2 ̸= 0, then we have the unique solution of the given system. Now, for α = ±1 we have two
cases. For α = 1, the last equation can be written as follows:

0x1 + 0x2 + 0x3 = 0.

9
Clearly, x3 is the free variable, and hence the system has infinitely many solutions.
For α = −1, the last equation can be expressed as follows:

0x1 + 0x2 + 0x3 = 2,

which is not possible, so there is no solution. Hence, we can say that for α ̸= ±1 system has a unique solution;
for α = −1 system has no solution; and for α = 1 system has infinitely many solutions.

10