#Day 12: Extended euclidean algorithm
One of the most fundamentals algorithms in number theory is extended euclidean algorithm. It’s purpose is to solve Diophantine equation
ax + by = GCD(a, b)
-
Notifications
You must be signed in to change notification settings - Fork 0
howeih/Day-12-Extended-euclidean-algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Day 12: Extended euclidean algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published