vault backup: 2026-03-09 19:43:13

2026-03-09 19:43:13 +01:00
parent 8ad531a2e4
commit e090eadcfa
7 changed files with 659 additions and 8 deletions
--- a/DAS/Arithmetic.md
+++ b/DAS/Arithmetic.md
@@ -29,6 +29,4 @@ 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** -> $$
-
-
+2.  **Substitute remainders** ->