diff --git a/DAS/Arithmetic.md b/DAS/Arithmetic.md
index 0ed6c19..605e8fa 100644
--- a/DAS/Arithmetic.md
+++ b/DAS/Arithmetic.md
@@ -29,4 +29,5 @@ Result is the last $"Remainder"$ that is not $0$.
 **Goal:** find a $x$ and $y$ so that $"Divident" * x + "Divisor" * y = gcd("Dividend", "Divisor")$
 
 1. **Rewrite Euclid (above) equations** to solve for remainder ($"Remainder" = "Old Remainder" - "Dividend" * "Divisor"$)
-2.  **Substitute remainders** -> 
\ No newline at end of file
+2.  **Substitute remainders** 
+3. **Simplify** (Final Form: $"GCD" = x * "Dividend" + "y * Divisor"$)