Euclidean algorithm
concept- Requires → Greatest common divisor
- Explanation → Why remainder steps preserve the GCD
- Explanation → Why remainder steps preserve the GCD
- Explanation → Subtractive Euclidean algorithm with an explicit proof boundary
- Explanation → Subtractive Euclidean algorithm with an explicit proof boundary
- Application → Two Euclidean algorithm worked examples
- Application → A complete Euclidean-algorithm calculation
- Application → Recursive implementation and remainder-call complexity
- Application → Two Euclidean algorithm worked examples
- Application → Recursive implementation and remainder-call complexity
- Application → Euclidean algorithm through two worked examples
- Application → Euclidean algorithm through two worked examples
- Application → A complete Euclidean-algorithm calculation