CHAPTER- 4

SOLUTIONS OF SYSTEM OF LINEAR EQUATIONS

4.1 Matrix representation of Linear equations

Consider a system of m linear equations in n unknowns

+ + +⋯+ =
  + + + ⋯+ =
… (1)
⋮
+ + + ⋯+ =

In matrix form , we can write the system of equations (1) as

…
…
A= ⋮ ⋮
= ⋮
⋮ ⋮
…

AX=B

where A , B , X are respectively called the coefficient matrix , requirement vector

and the solution vector .

4.2 Non- Homogeneous and Homogeneous Systems of Linear Equations –

The system of equations given by (1) is said to be the system of non-homogeneous linear
equations if at least onebi ≠ 0 i.e, ≠ ( ) and it is called homogeneous if
each bi= 0, thus matrix form of homogeneous linear equations is = 0.

A Consistent and Inconsistent system A system of equations is called consistent if it has at

least one solution otherwise it is called inconsistent. A consistent system has either a unique
solution or infinitely many solutions. A homogeneous system is always consistent.

Methods to solve simultaneous linear equations –

The following methods are useful to solve linear equations

1. Matrix Inversion method (or using of adjoint of the coefficient matrix )

2. Cramer`s rule (or using of determinant)
3. Gauss elimination method
 4. Method of rank approach
As per discussion in the previous classes, it is well known that the first two methods are
applicable only when = i.e. to solve system of n equations in n unknowns (or when
the coefficient matrix is a square matrix) and also these methods are not used for large
values of n, say > 4, while the third and forth methods are applicable in general i.e. also
in the case when ≠ or > 4.
In the next section, we deal with these method one-by-one .The method of rank approach is
the more general method since it can be used in the all situations so we shall discuss it in
detailed while the others in brief .

Matrix Inversion method (or using adjoint of the coefficient matrix)-

For Non-Homogeneous system –

Consider a non-homogeneous system of n- equations in n unknowns

+ + +⋯+ =
  + + + ⋯+ =
… (1)
⋮
+ + + ⋯+ =

Its matrix form is =

…
Where = … , = & =
⋮ ⋮ ⋮ ⋮ ⋮
…

First find the determinant of the coefficient matrix A i.e. | |.

Now

i. If | | ≠ 0then the system is consistent and has unique solution given by

=
ii. If | | = 0 and ( ) = then the system is consistent and has infinite many
solutions.
iii. If | | = 0 and ( ) ≠ then the system is inconsistent i.e. has no solution.

For Homogeneous system-

Let = 0 be a homogeneous system of n-equations in n unknowns.
i. If A is non singular i.e.| | ≠ 0 then the system has unique solution
= 0, = 0, … … . … , =0
This solution is called zero or trivial solution
ii. If A is singular i.e.| | = 0 then the system has also non trivial (non-zero) solutions

Example 1 Test the consistency of the following system of equations and if consistent find
the solution
2 − +3 =9
+ + =6
− + =2
Solution The matrix form the given equations is
2 −1 3 9
1 1 1 = 6
1 −1 1 2
i.e. =
we have | | = 2(1 + 1) + 1(1 − 1) + 3(−1 − 1)
= 2.2 + 1.0 + 3(−2) = −2 ≠ 0
Since | | ≠ 0 therefore the given system of equations is consistent and has unique solution
given by
= … (1)
Now to obtain we have
1 1
Cofactor of = = (−1) =2
−1 1
And similarly we can find = 0, = −2, = −2, = −1, = 1, = −4, =
1, =3
2 −2 −4
adj A = 0 −1 1
−2 1 3
2 −2 −4
and =| |
= − 0 −1 1
−2 1 3

2 −2 −4 9 −2 1
Now by (1), we have =− 0 −1 1 6 = − −4 = 2
−2 1 3 2 −6 3
Hence the required solution of the given section the equations, is = 1, = 2, = 3
Example 2 using matrix method test the consistency of the equations
3 − −2 =2
2 − = −1
3 −5 =3
3 −1 −2 2
Solution The matrix form of the given system is 0 2 −1 = −1
3 −5 0 3
A X = B
We have
3 −1 −2
| |= 0 2 −1 = 3 (0 - 5) + 1 (0 + 3) + 1 (0 + 3) – 2 (0 - 6) = -15 + 3 + 12 = -15 + 15 =
3 −5 0
0
And the conations of the elements of A are
= -5 = -3 = -6
=5 =6 = 12
=5 =3 =6

−5 −3 −6
∴ adj A = 5 6 12
5 3 6
now
−5 −3 −6 2 −10 +3 −18 −25
(adj A ) B = 5 6 12 −1 = 10 −6 +36 = 30
5 3 6 3 10 −3 +18 25

Since | | = 0 and (adj A) B≠ 0 therefore the system is in consistent i, e. has no solution .

Example 3 Determine the values of K for which the system of equations

x – xy + z = 0
kx + 3y – kz = 0
3x + y – z = 0
Has (i) only trivial solution (ii) non - trivial solution.

Solution – The given system is homogeneous and its matrix form is

Ax = 0
 Where
1 − 1
A= 3 − & =
3 1 −1

1 − 1
We have | | = 3 −
3 1 −1
= 1 (-3 + k) + k (-k + 3k) + 1 (k - 9)
= -3 + k + 2 +k–9
=2 + 2k – 12 = 2 (k- 3) (k + 4)
We know that the given has only trivial solution if | | ≠ 0
= 2 (k - 3) (k + 4) ≠ 0 = k ≠ 3 & k ≠ - 4
And for non trivial solution ,| | = 0
= k = 3 or k = -4 .

CRAMER’S RULE (USING DETERMINATS)

For Non Homogeneous system
As mentioned earlier that the matrix invention method and Cramer s rule are not used for
large values of n , say n >4, i. e, not to solve system of move than 4 ×4 order , so we
have consider a system of 3 equations in 3 unknown ,
+ + =
+ + =
+ + =
Find we tied the values of the values of the following four detriments

D= =
_3

= and =
_3
Now
i. If ≠ 0 then system is consistent and has unique solution given by

= = =
 ii. If = 0 and = = = 0 then system is consistent and has infinitely many
solutions.
iii. If = 0 and none of , & is zero then system is inconsistent i,e. has no
solution .
For non- Homogeneous System -
In this care there are the same conclusions as mentioned in the previous method for
homogeneous system

Example 1 using Cramer’s rule, solve

− +3 =3

2 +3 + =2

3 +2 +4 =5

Solutions we have

1 −1 3
= 2 3 1 = 1(12 − 2) + 1(8 − 3) + 3(4 − 9) = 15 − 15 = 0
3 2 4

1 −1 3
= 2 3 1 = 3(12 − 2) + 1(8 − 5) + 3(4 − 15) = 30 + 3 − 33 = 0
3 2 4

1 3 3 1 −1 3
= 2 2 1 =0 & = 2 3 2 =0
3 5 4 3 2 5

∵ = 0 and = = = 0 therefore the given system is consistent and has

infinite number of solutions which can be obtained as :

Assume = where k is an orbiting constant

Now putting = in the two equations and solving for & we get.

= =

Example 2. using Cramer’s rule solve

 − + =4

2 + −3 =0

+ + =2

Solution- we have

1 −1 1
= 2 1 −3 = 1(1 + 3) + 1(2 + 3) + 1(2 − 1) = 10
1 1 1

4 −1 1
= 0 1 −3 = 4(1 + 3) + 1(0 + 6) + 1(0 − 2) = 20
2 1 1

1 4 1
= 2 0 −3 = 1(0 + 6) − 4(2 + 3) + 1(4 − 0) = −10
1 2 1

1 −1 4
= 2 1 0 = 1(2 − 0) + 1(4 − 0) + 4(2 − 1) = 10
1 1 2

Since ≠ 0 therefore the given system has unique solve as

= = = 2, = = = −1 & = = =1.

GAUSS ELIMINATION METHOD

Consider the system of equations = ….(1)

In this method, apply row elementary transformation for matrix on both A and B so that the
matrix A is reduced to the upper triangular form. if in this process to A, and B to B, then
AX= B given = , which when solved by back substitution gives the required
solution of the given system of equations …(1) .

Example 1 solve the system

−2 +3 =2
2 −3 =3
+ + =0
By Gauss elimination method
 1 −2 3 2
Solution The matrix form of the given system is 2 0 −3 = 3
1 1 1 0

A X =B

By applying → −2 and → −

1 −2 3 2
0 4 −9 = −1
0 3 −2 −2

By applying → −

1 −2 3 2
0 4 −9 = −1
0 0

Example 2 By Gauss elimination method, solve

+ +2 + =5
2 +3 − −2 =2
4 +5 +3 =7

Solution the matrix form of the system is

1 1 2 1 5
2 3 −1 −2 = 2
4 5 3 0 7

By → −2 & → −4

1 1 2 1 5
0 1 −5 −4 = −8
0 1 −5 −4 −13

By → −

1 1 2 1 5
0 1 −5 −4 = −8
0 0 0 0 −13
 ⇛ + +2 + =5

0 +1 −5 −4 = −8

0 +0 +0 +0 = −5

Then last one of these equations show that 0 = −5, which is absurd. Hence the given
system of equations is inconsistent.

METHOD OF RANK APPROACH

For non Homogeneous system

Consider a non homogeneous system of m equations in n unknowns

+ + +⋯+ =
  + + + ⋯+ =
… (1)
⋮
+ + + ⋯+ =

The matrix form, of the system, is

…
…
Where A = ⋮ called coefficient matrix.
⋮ ⋮
…

Write the augmented matrix

… ⋮
… ⋮
[ , ]= ⋮
⋮ ⋮ ⋮
… ⋮

And then find the ranks of the coefficient matrix A and augmented matrix [A, B] for which,
reduce [A, B] to echelon form by applying row elementary transformations only. This
echelon form gives the rank of the augmented matrix [A , B] and by deleting the last column
of the echelon form of [A , B] we get the echelon form of the coefficient matrix A which
gives the rank of A. Thus the echelon form of the augmented matrix [A , B] provides the
ranks of A & [A,B] both.
Now there may arise any one of the following cases

i. If (A) = [A , B] = r = n (no. of unknowns ) then system is consistent and has

unique solution.
ii. If (A) = [ , ] = < (no. of unknowns) then system is consistent and has
infinite number of solutions in this case only ( − + 1) solutions are linearly
independent and rest of the solutions are the liners combinations of there ( − + 1)
independent solutions.
iii. If ( ) ≠ [ , ] then system is inconsistent i.e. has no solution.

For homogenous system –

Consider a homogeneous system of m equations in n unknowns
+ + ⋯+ =0
+ +⋯+ =0
−−−−−−−−−−−−−−
+ + ⋯+ =0
The matrix form is AX = 0
…
…
Where A = ⋮
⋮ ⋮
…

Some Important Results about the Nature of Solutions of the Equation AX = O.

Suppose we have m equations in n unknowns. Then the coefficient matrix A will be of the
type m x n. Let r be the rank of the matrix A. Obviously r cannot be greater than n (the
number of columns of the matrix A). Therefore we have either r = n or r<n.

Case I. If r = n, the equation AX = O will have n –n i.e., no linearly independent solutions.

In this case the zero solution will be the only solution. We know that zero vector forms a
linearly dependent set.

Case II. If r < n, we shall n – r linearly independent solutions. Any linear combination of
these n – r solutions will also be a solution of AX = O. Thus in this case the equation AX =
O will have an infinite number of solutions.
Case III. Suppose m < n i.e., the number of equations is less than the number of unknowns.
Since r ≤ m, therefore r is definitely less than n. Hence in this case the given system of
equations must possess a non-zero solution. The number of solutions of the equation AX =
O will be infinite.

Remark

1. If the coefficient matrix is a square matrix i.e. no. of equations is equal to no. of
unknowns then system has only trivial solution | | ≠ 0. And also non trivial solutions if
| |=0

2. A system of homogenous linear equations has a non trivial solution if the number of
equations is less than the number of unknowns.

Fundamental Set of Solutions of the Equation AX = O.

Suppose the rank r of the coefficient matrix A is less than the number of the unknown’s n.
In this case the given equations have a set of n – r linearly independent solutions and every
possible solution is a linear combination of these n – r solutions. This set of n – r solutions is
called a fundamental set of solutions of the equation AX = O.

A set of linearly independent solution , ,…., of the system of homogeneous

equations AX = O is called the fundamental system of solutions of AX = O, if every
solution X of AX = O can be written as a linear combination of these i.e., in the form

= + + …….+ ,

Where , ,……., are suitable numbers.

SOLVED EXAMPLES

Example 1 show that system of equations

3 +3 +2 =1

+2 =4

10 + 3 = −2
2 − 3 − = 5, is consistent and hence solve it.

Solution The given of equation can be written in the matrix form

3 3 2 1
1 2 0 = 4
1 10 3 −2
2 −3 −1 5

3 3 2 1
The augmented matrix[ , ] = 1 2 0 4
0 10 3 −2
2 −3 −1 5

1 2 0 4
[ , ]~ 3 3 2 1
0 10 3 −2
2 −3 −1 5

1 2 0 4
~ 0 −3 2 −11 ⟶ −3 ⟶ −2
0 10 3 −2
0 −7 −1 −3

1 2 0 4
0 −3 2 −11
~ − ⟶ + 10 ⟶
0 0
0 0 − −

1 2 0 4
~ 0 −3 2 −11 ⟶ ⟶ ⟶
0 0 1 −4
0 0 1 −4

1 2 0
4
~ 0 −3 2 −11 by ⟶ −
0 0 1 −4
0 0 0 0

⇛ ([ . ]) = 3

And also ( ) = 3
i.e. ([ , ]) = ( ) = 3 = 0. unknowns therefore the given system is consistent and
has unique solution

Further, from the above echelon form, the given system in matrix form reduces to

1 2 0 4
0 −3 2 = −11
0 0 1 −4
0 0 0 0

⇒ + 2 = 4, −3 + 2 = −11& = −4

⇒ = 2, = 1, = −4

Thus the unique solution is = 2, = 1, = −4

Example 2 Investigate for what values of , , the equations

+ + =6

+ 2 + 3 = 10

+2 + =

Have (1) no solution, (2) a unique solution, (3) infinity of solutions.

Solution The given system of equations can be written in the following matrix form :

1 1 1 6
1 2 3 = 10
1 2

Performing the operations (−1), we get

1 1 1 6
0 1 2 = 4
0 1 −1 −6

Now performing (−1), we get

1 1 1 6
0 1 2 = 4
0 0 −3 − 10
 Whence ( − 3) = − 10.

We thus observe the following :

i. If = 3, ≠ 10, the system is inconsistent, so there is no solution.

ii. If ≠ 3, it is possible to find a unique value of z and then unique values of x and y.
in this case there is a unique solution.
iii. If = 3, = 10, the last equation has the form 0. = 0 and we can assign arbitrary
values to z, obtaining corresponding values of x and y. So in this case, the number of
solutions is infinity .

Example 3 Investigate for what values of the equations

+ + = 6,

+ 2 + 4 = 10,

2 +3 + =

Have (1) no solution, (2) a unique solution, and (3) infinitely many solutions.

Solution The given system of equations can be written in the following matrix form :

1 1 1 6
1 2 4 = 10
2 3

Performing the operations (−2) and , we get

1 1 1 6
0 1 3 = 4
0 1 −2 − 12

Now performing (−1), we get

1 1 1 6
0 1 3 = 4
0 0 −5 − 16

Whence ( − 5) = − 16.

We thus observe the following :

 i. If = 5, ≠ 16, the system is inconsistent, so there is no solution.
ii. If ≠ 5, it is possible to find a unique value of z form (1), and then unique values of
x and y. So there is a unique solution.
iii. If = 5, ≠ 16, equation (1) has the form 0. z = 0 and we can assign arbitrary
values to z, obtaining corresponding values of x and y. So, the number of solution is infinity.

Example 4 Find out for what values of , the equations

+ + = 1,

+2 +4 = ,

+ 4 + 10 =

Have a solution and solve completely in each case.

Solution Here we have

1 1 1 1 1 1 ⋮ 1
= 1 2 4 [ , ]= 1 2 4 ⋮
1 4 10 1 4 10 ⋮

By the operations (−1) and (−1), we have

1 1 1 ⋮ 1
[ , ]~ 0 1 3 ⋮ −1
0 3 9 ⋮ −1

By (−3), we have

1 1 1 ⋮1
[ , ]~ 0 1 3 ⋮ −1 …….(1)
0 0 0 ⋮ −3 +2

Whence rank A=2. The system of equations will be consistent if rank [ , ] = = 2.

Hence we must have

− 3 + 2 = 0, ℎ = 1, 2.

From (1), an equivalent system of equations is

+ + = 1,
 +3 = − 1. …….(2)

Since rank A= rank [ , ] = =2< = 3 (the number of unknowns ),there will be an

infinite number of solutions. Taking = , where k is an arbitrary constant, and solving the
equations (2), we obtain

= 2 − + 2,

= −1−3 ,

= .

And

When = 1 the solutions are given by = 2 + 1, = −3 , = .

When = 2, the solutions are given by =2 , =1−3 , = .

Example 5 How many number of linearly independent solutions of the following equations
are possible?

+ −2 + +3 = 1,

2 − +2 +2 +6 =2

3 +2 −4 −3 −9 = 3.

Solution The augmented matrix:

1 1 −2 1 3 : 1
[ , ]= 2 −1 2 2 6 : 2
3 2 −4 −3 9 : 3

1 1 −2 1 3 : 1
~ 0 −3 6 0 0 : 0 , by (−2) (−3)
0 −1 2 −6 −18 : 0

1 1 −2 1 3 : 1
~ 0 1 −2 0 0 : 0 ,by −
0 −1 2 −6 −18 : 0
 1 1 −2 1 3 : 1
~ 0 1 −2 0 0 : 0 , by (1)
0 0 0 −6 −18 : 0

1 1 −2 1 3 : 1
~ 0 1 −2 0 0 : 0 , by − .
0 0 0 1 3 : 0

This matrix is in echelon form. The number of non-zero rows in it for both the matrices A
and [ , ] is 3. Hence

Rank A= rank [ , ] = 3 (= , ).

thus the given system of equations is consistent.

Also, the number of linearly independent solution

= − + 1 = 5 − 3 + 1 = 3.

Example 6 Find the real values of for which the following equations have a non-zero
solution :

+2 +3 = ,

3 + +2 = ,

2 +3 + = .

Solution The given equations can be written as

(1 − ) + 2 + 3 = 0,

3 + (1 − ) + 2 = 0,

2 + 3 + (1 − ) = .

We know that a system of n linear homogeneous equations in n unknowns has a non-zero

solution if the coefficient matrix is singular.

In the present case, we have

Number of equations = 3 = number of unknown.

So, the above equations will have a non-zero solution if

1− 2 3
3 1− 2 = 0,
2 3 1−

i.e., (1 − ){(1 − ) − 6} + 2{4 − 3(1 − )} + 3{9 − 2(1 − )} = 0,

i.e., (1 − )( − 2 − 5) + 2(1 + 3 ) + 3(7 + 2 ) = 0,

i.e., ( −2 −5− +2 + 5 ) + 23 + 12 = 0,

i.e., −3 − 15 − 18 = 0,

i.e., ( − 6)( + 3 + 3) = 0.

The only real value of obtained from this is 6.

Hence 6 is the only real value of for which the given equations have a non-zero solution .

Example 7 Solve completely the system of equations

−2 + − = 0,

+ −2 +3 = 0,

4 + −5 +8 = 0,

5 −7 +2 − =0.

Solution The given system can be written in the following matrix form:

1 −2 1 −1 0
1 1 −2 3 = 0 .
4 1 −5 8 0
5 −7 2 −1 0

To reduce the coefficient matrix to Echelon to form, we first perform

(−1), (−4) (−5). Thus we have

1 −2 1 −1 0
0 3 −3 4 = 0 .
0 9 −9 12 0
0 3 −3 4 0
Next performing (−3) (−1), we get

1 −2 1 −1 0
0 3 −3 4 = 0 .
0 0 0 0 0
0 0 0 0 0

Finally, performing , we obtain

1 −2 1 −1 0
0 1 −1
= 0 .
0 0 0 0 0
0 0 0 0 0

Where the coefficient matrix is in echelon form.

This matrix equation is equivalent to the equations

−2 + − = 0,

4
− + =0.
3

We may now assign any values to z and w. Let us put = and = . Then the
equations reduce to

− 2 = −( − ),

4
= − .
3

Putting this value of y in the first one of these equations, we get = − . Hence

5 4
= − , = − , = , =
3 3

Is the general solution of the given system, where are arbitrary numbers.

4.3 Linear Dependence and Linear Independence of Vectors.

A set of n vectors X1,,X2 , X3,…….An are said to be linearly dependent(L.D.) if there exist n
scalars α1, α2, α3……..αn , not all are zero, such that
 α1X1+ α2X2 + α3X3 +…….+αnXn= O

further a set of n vectors X1,,X2 , X3,…….Xn are said to be linearly independent(L.I.) if there
exist n scalars α1, α2, α3……..αn , all are zero, such that

α1X1+ α2X2 + α3X3 +…….+αnXn = O

Important Facts-

i. A singleton set consisting of a non-zero vector is always L.I. and a singleton set
consisting of a zero vector is always L.D.
ii. Two vectors are L.D. if and only if one of them can be expressed as a scalar
multiple of the other.
iii. If in a set of vectors, any vector of the set is the linear combination of the
remaining vectors, then the vectors are L.D.

Linear Dependence and Linear Independence of Vectors by Rank Method-

i. If the rank of the matrix of the given vectors is equal to number of vectors, then the
vectors are linearly independent.
ii. If the rank of the matrix of the given vectors is less than the number of vectors, then
the vectors are linearly dependent.

SOLVED EXAMPLES

Example 1 Show using a matrix that the set of vectors

X = [ 1 2 -3 4 ] , Y = [ 3 -1 2 1 ] , Z = [ 1 -5 8 -7] is linearly dependent.

Solution Here we have

X = [ 1 2 -3 4 ] , Y = [ 3 -1 2 1 ] , Z = [ 1 -5 8 -7]

Let us form a matrix of the above vectors

1 2  3 4 
3  1 2 1 

1  5 8  7
 → −3 , → −

1 2  3 4 
~ 0  7 11  11
0  7 11  11

→ −

1 2  3 4 
~ 0  7 11  11
0 0 0 0 

Hence the rank of matrix = 2 < number of vectors

Hence , vectors are linearly dependent.

Example 2 Show using a matrix that the set of vectors : [ 2 5 2 -3] , [ 3 6 5 2] ,

[ 4 5 14 14] , [ 5 10 8 4] are linearly independent.

Solution The given vectors are

[ 2 5 2 -3] , [ 3 6 5 2] , [ 4 5 14 14] , [ 5 10 8 4]

Let us form a matrix of the above vectors

2 5 2  3
3 6 5 2 
A 
4 5 14 14 
 
5 10 8 4 

→ − , → − , → −
 2 5 2 3
1 1 3 5 
~ 
1  1 9 12 
 
1 5  6  10

1 1 3 5 
2 5 2  3 
~ 
1  1 9 12 
 
1 5  6  10

→ −2 , → − , → −

1 1 3 5 
0 3  4  13
~ 
0  2 6 7 
 
0 4  9  15

, → + , → −

1 1 3 5 
0 3  4  13
 10 5
~ 0 0 
 3 3 
  11 7 
0 4
3 3 

11
→ +
10

1 1 5 
3
0 3  4  13
 10  5
~ 0 0 
 3 3 
 1 
0 0 0
2 

Here the rank of the matrix = 4 = Number of vectors.

Hence the vectors are linearly independent.

 EXERCISE

1. Solve the following equations using matrix methods

+ + =9

2 + 5 + 7 = 52
2 + − =0

2. Examine the consistency of the following systems of equations, and if consistent find the
complete solutions:

2 +4 − = 9,
3 − + 5 = 5,
8 + 2 + 9 = 19.

3. Apply the test of rank to show that the following systems of equations are consistent.
Also solve them.

(i) + 2 − 5 = −9,
3 − + 2 = 5,
2 +3 − = 3,
4 −5 + = −3.

(ii) + 2 −z=3,
3 − + 2 = 1,
2 − 2 + 3 = 2,
− + = −1

4. Test the consistency of the following systems of equations and solve them:

(i) 5 + 7 − 13 = 0,
−3 + 11 − 53 = 0,
− 5 − 23 = 0,
2 − 3 + 18 = 0.
5. Show that the following systems of equations are consistent and solve them :
(i) + + = 3,
+ 2 + 3 = 4,
+ 4 + 9 = 6.

(ii) 4 + 3 + 6 = 25,
+ 5 + 7 = 13,
2 +9 + = 1.

6. Solve the following equations by matrix method :

+ 2 − 2 − 1 = 0,
4 +2 − − 2 = 0,
6 +6 + − 3 = 0.
considering specially the case when =2
7. Find out the solutions of following systems of equations :

−2 + − + 1 = 0,

3 −2 +3 + 4 = 0,
5 −4 + + 3 = 0.

8. solve the following system of equations :

+ + = ,

+ + = ,
+ + = .

9. Does the following systems of equations possess non-trivial solutions :

(i) 2 −3 + = 0,
+ 2 − 3 = 0,
4 − − 2 = 0.

(ii) 2 + − 3 = 0,
− 3 + 2 = 0,
4 +2 − = 0.
 10. Find all the solutions of the following systems of equations:
(i) 2 −3 + = 0,
+ 2 − 3 = 0,
4 − − 2 = 0.

(ii) + 2 + 3 = 0,

3 + 4 + 4 = 0,
7 + 6 + 12 = 0.
(iii)

−2 + = 0,

−2 − = 0,
2 −4 −5 = 0.

(iv) + −6 = 0,

−3 + +2 = 0,
− +2 = 0.

11. Find the general solution of the matrix equation:

2 3 −1 −1
1 −2 −2 −4 = 0.
3 1 3 −2
6 2 0 −7

12. Show, by considering the rank of an appropriate matrix, that the following system of
equations possesses no solution other than the trivial solution = 0, = 0, =0∶

3 − + = 0,

−15 + 6 − 5 = 0,

5 − 2 + 2 = 0.
13. Let AX = 0 be a system of linear equations, where A = [ ] × , X is a column
matrix and 0 is a null matrix. If Rank(A) = r <n , then the system has :

(a) Exactly r linearly independent solutions

(b) Exactly n linearly independent solutions

(c) Exactly n - r linearly independent solutions

(d) None of these

14. If two vectors v1 and v2 are equal , then the set { v1 , v2 , ….., vn } is:

(a) Linearly dependent

(b) Linearly independent

(c) May not be linearly dependent

(d) None of these

15. The vector e1 = (1 0 0 ) , e2 = (0 1 0 ) and e3 = (0 0 1 ) are :

(a) Linearly dependent

(b) Linearly independent

(c) Not linearly independent

(d) None of these