This project is a C program that reads n<=N integers and finds their gcd with Euclides' algorithm and Bezout's identity. Also it makes a test for verifying the results. This project is just for practising a math concept.
-
Notifications
You must be signed in to change notification settings - Fork 0
A program that reads n<=N integers and finds their gcd, with Euclides' algorithm and Bezout's identity.
License
AdriiE17/euclides-and-bezout
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A program that reads n<=N integers and finds their gcd, with Euclides' algorithm and Bezout's identity.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published