This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We will perform Gauss-Jordan Elimination to obtain the Reduced Row Echelon Form of the given matrix.
Recall that we can perform any of the following three row operations on the matrix:
The top left element is a pivot, so the rest of the elements in the first column must be zero. We can subtract multiples of first row from second and third row so that the first column becomes ⎣ ⎡ 1 0 0 ⎦ ⎤ .
⎣ ⎡ 1 6 2 4 4 2 − 5 0 − 1 ⎦ ⎤ R X 2 − 6 R X 1 ⎣ ⎡ 1 0 2 4 − 2 0 2 − 5 3 0 − 1 ⎦ ⎤ R X 3 − 2 R X 1 ⎣ ⎡ 1 0 0 4 − 2 0 − 6 − 5 3 0 9 ⎦ ⎤
Now that the leftmost column is ⎣ ⎡ 1 0 0 ⎦ ⎤ , the middle element can be made 1 by dividing the second row by -20 .
⎣ ⎡ 1 0 0 4 − 2 0 − 6 − 5 3 0 9 ⎦ ⎤ Divide the second row by − 2 0 ⎣ ⎡ 1 0 0 4 1 − 6 − 5 − 1 . 5 9 ⎦ ⎤
We will now make the second column of the matrix ⎣ ⎡ 0 1 0 ⎦ ⎤ by adding scalar multiples of the second row to the first and third rows.
⎣ ⎡ 1 0 0 4 1 − 6 − 5 − 1 . 5 9 ⎦ ⎤ R X 1 − 4 R X 2 ⎣ ⎡ 1 0 0 0 1 − 6 1 − 1 . 5 9 ⎦ ⎤ R X 3 + 6 R X 2 ⎣ ⎡ 1 0 0 0 1 0 1 − 1 . 5 0 ⎦ ⎤
We have now completed Gauss-Jordan elimination and have obtained the Reduced Row Echelon Form of the given matrix. rref ( A ) = ⎣ ⎡ 1 0 0 0 1 0 1 − 1 . 5 0 ⎦ ⎤
The sum of the entries is 1 + 1 + 1 − 1 . 5 = 1 . 5 □