diff --git a/DAS/Arithmetic.md b/DAS/Arithmetic.md
index 605e8fa..87e3d41 100644
--- a/DAS/Arithmetic.md
+++ b/DAS/Arithmetic.md
@@ -31,3 +31,7 @@ Result is the last $"Remainder"$ that is not $0$.
 1. **Rewrite Euclid (above) equations** to solve for remainder ($"Remainder" = "Old Remainder" - "Dividend" * "Divisor"$)
 2.  **Substitute remainders** 
 3. **Simplify** (Final Form: $"GCD" = x * "Dividend" + "y * Divisor"$)
+
+### Extended Euclidian Algorithm
+1. **Find GCD** using Euclidian Algorithm
+2. 
\ No newline at end of file