From 4cac921de3fdaac1fc23c64305cd255be7da2a4a Mon Sep 17 00:00:00 2001
From: ben-jaynes <1btjaynes@gmail.com>
Date: Sun, 4 Oct 2026 22:11:24 -0700
Subject: [PATCH] vault backup: 2026-10-04 22:11:24

---
 College/AU 26/MATH 208 (Matrix Algebra)/Chapter 1.2 Notes.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/College/AU 26/MATH 208 (Matrix Algebra)/Chapter 1.2 Notes.md b/College/AU 26/MATH 208 (Matrix Algebra)/Chapter 1.2 Notes.md
index 718e064..261a097 100644
--- a/College/AU 26/MATH 208 (Matrix Algebra)/Chapter 1.2 Notes.md	
+++ b/College/AU 26/MATH 208 (Matrix Algebra)/Chapter 1.2 Notes.md	
@@ -16,7 +16,7 @@
 	- this is converting a matrix to **echelon form** (or row echelon form)
 		- this is when every leading term is a column to the left of the one below it and any zero rows are at the bottom
 	- once the augmented matrix is in echelon form it can be converted back into a linear system of equations (that is not in echelon form) and solved
-	- the pivot is the coefficient of the leading terms (or the fr)
+	- the pivot is the coefficient of the leading terms (or the free variables)
 - Gauss-Jordan elimination
 	- this can make it easier to find the general solution of the system
 	- 1. multiply each nonzero row by the inverse of the pivot so every pivot is 1