Implementation of the simplest algorithms of number theory
Functional:
- GCD of two numbers using Euclid's algorithm
- Euler's function (number of coprime numbers less than n)
-
Notifications
You must be signed in to change notification settings - Fork 0
laxier/maths-functions
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of the simplest algorithms of number theory
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published