From 728ab722c80abaed57d0f01e1bb115fd292bde97 Mon Sep 17 00:00:00 2001 From: Jan Meyer Date: Mon, 9 Mar 2026 23:02:32 +0100 Subject: [PATCH] vault backup: 2026-03-09 23:02:32 --- DAS/Arithmetic.md | 4 ++++ 1 file changed, 4 insertions(+) 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