StarMirror/algorithm-in-python
1
0
Fork 0
mirror of https://github.com/heqin-zhu/algorithm.git synced 2024-03-22 13:30:46 +08:00
Code Issues Projects Releases Wiki Activity
36ebaecf18
algorithm-in-python/math
History
mbinary 36ebaecf18 Update permute and add dft.py
2020-01-01 15:51:32 +08:00
..
fibonacci Add codecog for latex 2019-03-18 00:46:56 +08:00
numberTheory Update shellSort, Add fibnacci computation method of matrix power 2019-03-06 19:11:01 +08:00
numericalAnalysis Add license and bages, change urls 2019-01-31 12:09:46 +08:00
numWeight Add fft, add header info 2019-06-11 16:26:24 +08:00
permute Update permute and add dft.py 2020-01-01 15:51:32 +08:00
dft.py Update permute and add dft.py 2020-01-01 15:51:32 +08:00
fastPow.py Add license and bages, change urls 2019-01-31 12:09:46 +08:00
README.md Add license and bages, change urls 2019-01-31 12:09:46 +08:00

README.md

Number Theory

See more details on my blog

gcd.py

  • gcd(a,b)
  • xgcd(a,b): return gcd(a,b),x,y, where ax+by = gcd(a,b)

isPrime

  • isPrime(n): using Miller-Rabin primalrity test.
  • primeSieve

euler.py

  • phi(n): euler function
  • sigma(n): return the sum of all factors of n

factor.py

  • factor(n): return a list of numbers that are the factorization of n

modulo_equation.py

Solving modulo equations

solver  = solve()
res = solver.solveLinear(3,6,9)

res = solver.solveHigh(1,8,3,11)

res = solver.solveGroup([(5,11,2),(3,8,5),(4,1,7)])

Permutation