Number theory algorithms library C++ Language content code number theory algorithm library, which includes the following algorithms: Euclidean algorithm for a, b of the largest common multiple extended Euclidean algorithm, to derive gcd (a, b) and to meet gcd (a, b) = ax+ by the integer x and y-mode linear equations to solve ax ≡ b (mod n) in which n> 0 solving mode of linear equations (China remainder theorem) mode calculation computing exponentiation a ^ b mod n (a, b may be a lot) Miller-Rabin random prime number testing algorithm

数论
....\EUCLID.CPP
....\EUCLID.ICC
....\EUCLID.IN
....\EUCLID.IRS
....\EUCLID.OUT
....\Miller_Rabin.cpp
....\Miller_Rabin.icc
....\Miller_Rabin.in
....\Miller_Rabin.irs
....\Miller_Rabin.out
....\Miller_Rabin~.out
....\Modular_Expoent.cpp
....\Modular_Expoent.icc
....\Modular_Expoent.in
....\Modular_Expoent.irs
....\Modular_Expoent.out
....\modular_linear_equation.cpp
....\modular_linear_equation.icc
....\modular_linear_equation.in
....\modular_linear_equation.irs
....\modular_linear_equation.out
....\modular_linear_equation_group.cpp
....\modular_linear_equation_group.icc
....\modular_linear_equation_group.in
....\modular_linear_equation_group.irs
....\modular_linear_equation_group.out
....\number theory.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．