0% found this document useful (0 votes)
210 views

Solved Problems in Linear Equations

This document discusses problems involving linear equations and their solutions. It covers homogeneous and non-homogeneous systems of linear equations, and uses Gauss-Jordan elimination methods to determine consistency and find solutions. Several example problems are worked through step-by-step to illustrate the different cases and solutions. The key topics covered are determining consistency, finding the rank of matrices, determining the number of solutions, and using elementary row operations to transform systems into triangular form.
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
210 views

Solved Problems in Linear Equations

This document discusses problems involving linear equations and their solutions. It covers homogeneous and non-homogeneous systems of linear equations, and uses Gauss-Jordan elimination methods to determine consistency and find solutions. Several example problems are worked through step-by-step to illustrate the different cases and solutions. The key topics covered are determining consistency, finding the rank of matrices, determining the number of solutions, and using elementary row operations to transform systems into triangular form.
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

PROBLEMS IN LINEAR EQUATIONS

PROF. SEBASTIAN VATTAMATTAM

1. Homogeneous System of Linear Equations Problem 1.1. The vector (c1 , c2 , c3 ) is a solution of a11 x1 + a12 x2 + a13 x3 = 0 a21 x1 + a22 x2 + a23 x3 = 0 a31 x1 + a32 x2 + a33 x3 = 0 Show that, for k = 0, (kc1 , kc2 , kc3 ) is also a solution. Since (c1 , c2 , c3 ) is a solution of the system of equations, a11 c1 + a12 c2 + a13 c3 = 0 a21 c1 + a22 c2 + a23 c3 = 0 a31 c1 + a32 c2 + a33 c3 = 0 Multiplying each equation by k, a11 kc1 + a12 kc2 + a13 kc3 = k(a11 c1 + a12 c2 + a13 c3 ) = 0 a21 kc1 + a22 kc2 + a23 kc3 = k(a21 c1 + a22 c2 + a23 c3 ) = 0 a31 kc1 + a32 kc2 + a33 kc3 = k(a31 c1 + a32 c2 + a33 c3 ) = 0 Hence the conclusion. Problem 1.2. Given the system of equations, (1) x + 3y + 2z = 1 (2) 2x + 2y z = 1 (3) x + 4y + 3z = 5 (1) Write down the coecient matrix. (2) Write down the augmented matrix. (3) Transform the augmented matrix to the triangular form. (4) Solve the system of equations.
1

PROF. SEBASTIAN VATTAMATTAM

(1) The coecient matrix is 1 3 2 A = 2 2 1 1 4 3 (2) The augmented matrix 1 2 [A : b] = 1 is 3 2 1 2 1 1 4 3 5

(3) Applying elementary raw transformations, 1 3 2 1 1 3 2 1 [A : b] = 2 2 1 1 0 4 5 3 1 4 3 5 0 1 1 4 1 3 2 1 0 1 1 4 0 4 5 3 1 3 2 1 0 1 1 4 0 0 1 13 1 0 1 11 4 0 1 1 0 0 1 13 1 0 1 11 4 0 1 1 0 0 1 13 1 0 0 24 0 1 0 17 0 0 1 13 (4) Hence we have, x1 = 24, x2 = 17, x3 = 13

LINEAR EQUATIONS

2. Non-homogeneous System of Linear Equations Gauss-Jordan Method Theorem 2.1. If Ax = b is a system of linear equations and [A : b] is the augmented matrix, then the system is consistent i rankA = rank[A : b] If rankA = rank[A : b] =: r and n denotes the number of unknowns, then Case 1: n = r. The system has a unique solution. Case 2: n > r. The system has innite number of solutions. n r of the unknowns can be given arbitrary values. Problem 2.2. Use Gauss-Jordan method to examine the consistency of the following system of linear equations. (4) x1 + x2 + x4 = 3 (5) x2 + x3 = 4 (6) x1 + 2x2 + x3 + x4 = 8 Solution Denote the equations by E1 , E2 , E3 Apply E3 E3 E1 (7) x1 + x2 + x4 (8) x2 + x3 (9) x2 + x3 Here 1.8 and 1.9 contradict each tem is not consistent. = 3 = 4 = 5 other, and hence the sys-

Gauss-Jordan method in the Matrix form

PROF. SEBASTIAN VATTAMATTAM

The system is of the form Ax = b where 1 1 0 1 A=0 1 1 0 1 2 1 1 Augmented matrix 1 1 0 1 . 3 [A, b] = 0 1 1 0 . 4 1 2 1 1 . 8 Apply the elementary transformation R3 R3 R1 1 1 0 1 . 3 [A : b] = 0 1 1 0 . 4 0 1 1 0 . 5 Apply the elementary transformation R3 R3 R2 1 1 0 1 . 3 [A : b] = 0 1 1 0 . 4 0 0 0 0 . 1 Now [A : b] is in the triangular form. rank[A : b] = 3, rankA = 2 rank[A : b] = rankA Therefore the system is not consistent. Problem 2.3. Use Gauss-Jordan method to examine the consistency of the following system of linear equations. (10) (11) x1 + x2 + x3 = 4 x1 + 2x2 = 6

Solution The system is of the form Ax = b Augmented matrix 1 1 1 . 4 [A : b] = 1 2 0 . 6

LINEAR EQUATIONS

Apply the elementary transformation R2 R2 R1 1 1 1 . 4 [A : b] = 0 1 1 . 2 Now [A : b] is in the triangular form. rank[A : b] = 2 = rankA Therefore the system is consistent. The equations in the reduced form are (12) (13) n = 3, n r = 1 Let x3 = a Then x2 = a + 2, x1 = 2a + a The general solution is 2 2 2a + 2 a + 2 = 2 + a 1 1 0 a Problem 2.4. Use Gauss-Jordan method to examine the consistency of the following system of linear equations. (14) (15) (16) x1 + x2 = 1 2x1 + x2 = 3 3x1 + 2x2 = 4 x1 + x2 + x3 = 4 x2 x3 = 2

Solution The system is of the form Ax = b Augmented matrix 1 1 . 1 [A : b] = 2 1 . 3 3 2 . 4 Apply the elementary transformations R2 R2 2R1 , R3 R3 3R1

PROF. SEBASTIAN VATTAMATTAM

1 1 . 1 [A : b] = 0 1 . 1 0 1 . 1 Apply the elementary transformation R3 R3 R2 1 1 . 1 [A : b] = 0 1 . 1 0 0 . 0 Now [A : b] is reduced to the triangular form. rank[A : b] = 2 = rankA Therefore the system is consistent. n=2=r There is a unique solution. The equations in the reduced form are (17) (18) The solution is 2 1 Problem 2.5. Use Gauss-Jordan method to examine the consistency of the following system of linear equations. (19) (20) 2x1 x2 + x3 + x4 = 6 x1 + x2 + x3 = 4 x1 + x2 = 1 x2 = 1

Solution The system is of the form Ax = b Augmented matrix [A : b] = 2 1 1 1 . 6 1 1 1 0 . 4 R1 R2

Apply the elementary transformations

LINEAR EQUATIONS

[A : b] =

1 1 1 0 . 4 2 1 1 1 . 6

Apply the elementary transformation R2 R2 2R1 [A : b] = 1 1 1 0 . 4 0 3 1 1 . 2

Now [A : b] is reduced to the triangular form. rank[A : b] = 2 = rankA Therefore the system is consistent. n = 4, r = 2 There are innite number of solutions. n r = 2 of the unknowns can be given arbitrary values. The equations in the reduced form are (21) (22) Let x3 = a, x4 = b The solution is
2ab+10 3 a+b+2 3

3x2 x3 + x4 = 2 x1 + x2 + x3 = 4

a b

2/3 1/3 10/3 1/3 + b 1/3 + 2/3 = a 1 0 0 0 1 0

PROF. SEBASTIAN VATTAMATTAM

Problem 2.6. Use Gauss-Jordan method to examine the consistency of the following system of linear equations. (23) (24) (25) (26) x1 + x4 x2 + 2x4 x3 + 0.5x4 2x3 + x4 = = = = 5 5 1 3

Solution The system is of the form Ax = b Augmented matrix 1 0 0 1 . 5 0 1 0 2 . 5 [A : b] = 0 0 1 0.5 . 1 0 0 2 1 . 3 Apply the elementary transformation R4 R4 2R3 1 0 0 1 0 1 0 2 [A : b] = 0 0 1 0.5 0 0 0 0 Now [A : b] is in the triangular form. rank[A : b] = 4, rankA = 3 rank[A : b] = rankA Therefore the system is not consistent. Problem 2.7. Use Gauss-Jordan method to examine the consistency of the following system of linear equations. (27) (28) (29) 2x2 + 2x3 = 4 x1 + 2x2 + x3 = 4 x2 x3 = 0

. . . .

5 5 1 1

LINEAR EQUATIONS

Solution The system is of the form Ax = b Augmented matrix 0 2 2 . 4 [A : b] = 1 2 1 . 4 0 1 1 . 0 Apply the elementary transformation R R2 1 1 2 1 . 4 [A : b] = 0 2 2 . 4 0 1 1 . 0 Apply the elementary transformation R2 (1/2)R2 1 2 1 . 4 [A : b] = 0 1 1 . 2 0 1 1 . 0 Apply the elementary transformation R3 R3 R2 1 2 1 . 4 [A : b] = 0 1 1 . 2 0 0 2 . 2 Now [A : b] is in the triangular form. rank[A : b] = 3, rankA = 3 The solution is x1 = x2 = x3 = 1 For any clarication please contact the author.
E-mail address: vattamattam@gmail.com

You might also like