Aug 1, 2025 · Jul 31, 2025
diff --git a/src/linear_algebra/linear-system-gauss.md b/src/linear_algebra/linear-system-gauss.md

 The algorithm is a `sequential elimination` of the variables in each equation, until each equation will have only one remaining variable. If $n = m$, you can think of it as transforming the matrix $A$ to identity matrix, and solve the equation in this obvious case, where solution is unique and is equal to coefficient $b_i$.

 Gaussian elimination is based on two simpletransformation:
 Gaussian elimination is based on two simpletransformations:

 * It is possible to exchange two equations
 * Any equation can be replaced by a linear combination of that row (with non-zero coefficient), and some other rows (with arbitrary coefficients).
Original file line number	Diff line number	Diff line change
Expand Up		@@ -42,7 +42,7 @@ Strictly speaking, the method described below should be called "Gauss-Jordan", o

		The algorithm is a `sequential elimination` of the variables in each equation, until each equation will have only one remaining variable. If $n = m$, you can think of it as transforming the matrix $A$ to identity matrix, and solve the equation in this obvious case, where solution is unique and is equal to coefficient $b_i$.

		Gaussian elimination is based on two simpletransformation:
		Gaussian elimination is based on two simpletransformations:

		* It is possible to exchange two equations
		* Any equation can be replaced by a linear combination of that row (with non-zero coefficient), and some other rows (with arbitrary coefficients).
Expand Down