jan/uni_notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2026-03-09 22:55:59

Browse Source
This commit is contained in:
Jan Meyer
2026-03-09 22:55:59 +01:00
parent 6408551302
commit b3401535ec
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
DAS/Arithmetic.md
View File

@@ -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** ->
2. **Substitute remainders**
3. **Simplify** (Final Form: $"GCD" = x * "Dividend" + "y * Divisor"$)