An assortment of functions for number theory / discrete math type problems
- Generating Primes ≤ n
- Prime Factors
- Fibonnaci numbers
- Extended Euclidean Algorithm
- Chinese Remainder Theorem
- Uniform Cost Search/Dijkstra's Algorithm
- A* Search
-
Notifications
You must be signed in to change notification settings - Fork 0
An assortment of functions for number theory / discrete math type problems
License
itincknell/DiscreteMath
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An assortment of functions for number theory / discrete math type problems
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published