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

vault backup: 2026-03-09 23:08:48

Browse Source
This commit is contained in:
Jan Meyer
2026-03-09 23:08:48 +01:00
parent 728ab722c8
commit 76620d2488
1 changed files with 5 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
DAS/Arithmetic.md
View File

@@ -33,5 +33,9 @@ Result is the last $"Remainder"$ that is not $0$.
3. **Simplify** (Final Form: $"GCD" = x * "Dividend" + "y * Divisor"$) 3. **Simplify** (Final Form: $"GCD" = x * "Dividend" + "y * Divisor"$)
### Extended Euclidian Algorithm ### Extended Euclidian Algorithm
Only valid for GCD = 1
1. **Find GCD** using Euclidian Algorithm 1. **Find GCD** using Euclidian Algorithm
2. 1. $A = q_1 * B + r_1$
2. $B = q_2 * r_1 + r_2$
3. $r_1 = q_3 * r_2 + 1$