number_theory_c++
所属分类：其他小程序
开发工具：C/C++
文件大小：9KB
下载次数：105
上传日期：2006-06-30 14:55:12
上 传 者：
henryld
说明： 数论算法库 C++ 语言实现
代码内容 数论算法库，包括以下算法：
欧几里德算法求a，b的最大公倍数
扩展的欧几里德算法，求出gcd(a,b)和满足gcd(a,b)=ax+by的整数x和y
求解模线性方程 ax ≡ b (mod n) 其中n>0
求解模线性方程组(中国余数定理)
模取幂运算 计算a^b mod n （a,b可能很大）
Miller-Rabin随机性素数测试算法
(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)
文件列表:
数论 (0, 2001-06-02)
数论\EUCLID.CPP (1505, 2000-10-25)
数论\EUCLID.ICC (51, 2000-10-25)
数论\EUCLID.IN (34, 2000-10-25)
数论\EUCLID.IRS (120, 2000-10-25)
数论\EUCLID.OUT (315, 2000-10-25)
数论\Miller_Rabin.cpp (1592, 2000-10-25)
数论\Miller_Rabin.icc (63, 2000-10-25)
数论\Miller_Rabin.in (52, 1999-10-25)
数论\Miller_Rabin.irs (126, 2000-10-25)
数论\Miller_Rabin.out (327, 2001-05-27)
数论\Miller_Rabin~.out (327, 2001-05-27)
数论\Modular_Expoent.cpp (1367, 2000-10-25)
数论\Modular_Expoent.icc (69, 2000-10-25)
数论\Modular_Expoent.in (32, 1999-10-25)
数论\Modular_Expoent.irs (129, 2000-10-25)
数论\Modular_Expoent.out (80, 2000-10-25)
数论\modular_linear_equation.cpp (1281, 2000-10-25)
数论\modular_linear_equation.icc (85, 2000-10-25)
数论\modular_linear_equation.in (23, 2000-10-25)
数论\modular_linear_equation.irs (137, 2000-10-25)
数论\modular_linear_equation.out (20, 2000-10-25)
数论\modular_linear_equation_group.cpp (1760, 2000-10-25)
数论\modular_linear_equation_group.icc (97, 2000-10-25)
数论\modular_linear_equation_group.in (15, 2000-10-25)
数论\modular_linear_equation_group.irs (143, 2000-10-25)
数论\modular_linear_equation_group.out (12, 2000-10-25)
数论\number theory.h (3939, 2001-05-27)
近期下载者：
相关文件：
收藏者：