Solves diophantine equations, also MCD (GCD) of two integers through euclidean algorithm.
This repository has been archived by the owner on Dec 9, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
kappanneo/Euclideo
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solves diophantine equations.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published