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
b69b5641d0
algorithm-in-python/math
History
mbinary b69b5641d0 Add license and bages, change urls
2019-01-31 12:09:46 +08:00
..
numberTheory Add license and bages, change urls 2019-01-31 12:09:46 +08:00
numericalAnalysis Add license and bages, change urls 2019-01-31 12:09:46 +08:00
permute Add license and bages, change urls 2019-01-31 12:09:46 +08:00
convertWeight.py Add license and bages, change urls 2019-01-31 12:09:46 +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