From 276b929f62bc6c88810486da4565082b9b2a8d83 Mon Sep 17 00:00:00 2001
From: yousvf <145223965+yousvf@users.noreply.github.com>
Date: Thu, 31 Jul 2025 11:48:33 +0300
Subject: [PATCH] Update linear-system-gauss.md

---
 src/linear_algebra/linear-system-gauss.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/linear_algebra/linear-system-gauss.md b/src/linear_algebra/linear-system-gauss.md
index 503a93b1f..ed05b5cf9 100644
--- a/src/linear_algebra/linear-system-gauss.md
+++ b/src/linear_algebra/linear-system-gauss.md
@@ -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 simple transformation:   
+Gaussian elimination is based on two simple transformations:   
 
 * 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).