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

Packet : 23825785number_theory_c  .zip filelist
数论/
数论/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．