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

vault backup: 2026-03-09 23:02:32

Browse Source
This commit is contained in:
Jan Meyer
2026-03-09 23:02:32 +01:00
parent b3401535ec
commit 728ab722c8
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
DAS/Arithmetic.md
View File

@@ -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"$) 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"$) 3. **Simplify** (Final Form: $"GCD" = x * "Dividend" + "y * Divisor"$)
### Extended Euclidian Algorithm
1. **Find GCD** using Euclidian Algorithm
2.