Skip to content
/ DiscreteMath Public

An assortment of functions for number theory / discrete math type problems

License

GPL-3.0 license
1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

itincknell/DiscreteMath

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits

LICENSE

LICENSE

 
 

README.md

README.md

 
 

discrete.py

discrete.py

 
 

Repository files navigation

DiscreteMath

An assortment of functions for number theory / discrete math type problems

  1. Generating Primes ≤ n
  2. Prime Factors
  3. Fibonnaci numbers
  4. Extended Euclidean Algorithm
  5. Chinese Remainder Theorem
  6. Uniform Cost Search/Dijkstra's Algorithm
  7. A* Search

About

An assortment of functions for number theory / discrete math type problems

Topics

prime-numbers dijsktra-shortest-path extended-euclidean-algorithm uniform-cost-search euclidean-algorithm a-star-search chinese-remainder-theorem prime-factorization

Resources

Readme

License

GPL-3.0 license
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages