搜索资源列表
GCD
- GCD为一个求取最大公因素的程式，输入两个数可以求得两数的最大公因素
最大值及最大公约数
- 求最大值及最大公约数。这是我初学C语言的一个源程序，希望对初学者有所帮助。-This program is going to get the maxium number and GCD.This source is the result of my first learning C,I hope it can be helpful for the first learner.
a223
- 此程式可輸入二個整數，並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
number_theory_c++
- 数论算法库 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随机性素数测试算法 -
BigInteger_src
- C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bi
gcd
- 密码学基础中求一个元素模p的逆元素，用扩展的欧几里德算法-Cryptography based on seeking an element of the inverse element of p-mode, with the expansion of the Euclidean algorithm
GCD
- GCD为一个求取最大公因素的程式，输入两个数可以求得两数的最大公因素-GCD is a greatest common factor to strike the program, enter two numbers to achieve two of the greatest common factor in several
gcd
- 欧几里得算法求最大公约数电路的Verilog实现，消耗功率较低-Euclid algorithm for the realization of the common denominator Verilog circuit, lower power consumption
GCD
- 最大公约数的计算,各个源描述的编译顺序:gcd.vhd,gcd_stim.vhd-The common denominator of the calculation, the various sources described in the order of the compiler: gcd.vhd, gcd_stim.vhd
gcd
- gcd 与随机数计算 可生成要求的随机数与计算gcd 范围可定-gcd calculation with the random number to generate random numbers with the requirements of the scope of the calculation may be set gcd
gcd
- Program to find GCD of two numbers using functions.
gcd
- 从键盘输入两个常数，求其最大公约数，并以常数形式输出-the greatest common divsion
gcd
- Simple gcd algorithm realization. 1st course assignment.
gcd
- A simulation of a circuit to calculate GCD Greater Common Divisor.
Gcd
- 里面含有几种经典的关于求最大公约数的经典求法比较，想必对数学类专业的同学有用。-several ways to get GCD
Poly_GCD_POWER_6_July2005
- If we need to verify the fact that a Polynomial has multiple roots iff (if and only if) it has a common factor with it s derivative, we need two things : a) A function to compute the GCD of 2 Polynomials. Since I co
gcd
- to get GCD(A,B)，and no recursion -to get GCD(A,B),and no recursion
多项式GCD
- 1。实现，用C／C++和MATLAB，欧几里德算法计算最大公司（GCD）的两个任意多项式在GF（2）。模拟和分析两给定阶数不小(1.Realize, by using c/c++ or Matlab, the Euclidean algorithm to calculate the greatest common division (GCD) for arbitrary two polynomials over GF(2). Simul
gcd
- gcd on c++ especially for acmers(gcdgcd on c++ especially for acmers)
GCD
- synthesis GCD using systemc