Returns integers x,y such that ax+by=gcd(a,b) for any two positive integers a,b taken as input
-
Notifications
You must be signed in to change notification settings - Fork 0
Ryan-Hardiman/ExtendedEuclidAlgorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Returns integers x,y such that ax+by=gcd(a,b) for any two positive integers a,b taken as input
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published