This program shows step-by-step how to find the GCD(Greatest Common Divisor) of two numbers by using the matrix method. Also shows the numbers to use for linear combination.
-
Notifications
You must be signed in to change notification settings - Fork 0
Epoza/GCD-Matrix-Method
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Shows step-by-step the GCD(Greatest Common Divisor) of two numbers using the matrix method
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published