vault backup: 2026-03-09 23:02:32
This commit is contained in:
@@ -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.
|
||||
Reference in New Issue
Block a user