搜索资源列表
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随机性素数测试算法
gudianmima
- 古典密码中，主要的思想为移位算法及置换算法。 1.移位密码 密钥K为整数，且取值空间为0到25；加密函数：x = x + k (mod 26)；解密函数：x = x - k (mod 26)。当K=3时，为凯撒密码。 2.仿射密码 密钥对由a、b组成，整数a满足 gcd(a, 26) = 1，整数b的取值空间为0到25；加密函数：x = ax + b(mod 26)；解密函数：x = a*y - a*b (mod 26)。当a=1,b=3时，为凯撒密码。 3.维吉
gcd
- 这是一个求最大公约数的verilog源码-this is a verilog source code which can count the greatest common divider .
GCD
- 求sa和tb的和使等于a和b的最大公约数-For sa and tb, and so equal to a and b of the common denominator
ou
- 欧几里德算法：辗转求余 原理: gcd(a,b)=gcd(b,a mod b) 当b为0时,两数的最大公约数即为a getchar()会接受前一个scanf的回车符-Euclidean algorithm: Principles of travel for more than: gcd (a, b) = gcd (b, a mod b) when b is 0, the two common denominator is the number of a getchar () will ac
gcd
- 从键盘输入两个常数，求其最大公约数，并以常数形式输出-the greatest common divsion
gcd
- A simulation of a circuit to calculate GCD Greater Common Divisor.
gcd
- oujilide suanfa de kuozhansuanfade shxiamzj jdsa lfjdas f-Euclid suandafa a ldjfdkuodahznadnfa,dfna dsfjdas fjdas
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 could not find a Standard Matlab
gcd
- to get GCD(A,B)，and no recursion -to get GCD(A,B),and no recursion
gcd_lcm
- 给出两整数a与b, 找出a与b的最小公倍数LCM(a,b), 找出a与b的最大公因子GCD(a,b).-finds the LCM(Lowest Common Multiple)/GCD(Greatest Common Divisor) of two positive integers
gcd
- The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y, define recursively as follows. It y is equal to 0, then gcd(x
GCD
- 用VC++ 开发AutoCAD的一个简单的示例代码-a simple sample of VC++ developing autoCAD
gcd
- this a program to calculate the gcd of two numbers and then display the result-this is a program to calculate the gcd of two numbers and then display the result
gcd
- 在VHDL里面实现一个简单的GCD算法，包含源代码，并且通过了编译和综合。-Inside the VHDL to implement a simple GCD algorithm, including source code, and through the compilation and synthesis.
GCD
- 一个很简单的计算两数最大公约数的java程序,希望对大家有帮助-A very simple calculation greatest common divisor of two numbers java program, we hope to help
main.cpp_1
- This program calculate if two numbers are coprimes For given integer N (1<=N<=10^4) find amout of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only
GCD_Verilog
- 利用Verilog语言写的采用更相减运算的球两个数的最大公约数-Using Verilog language written using a subtraction ball number two of the greatest common divisor
oujilide
- 广义欧几里得算法，用以计算两个数的最大公约数，依靠定理定理：gcd(a,b) = gcd(b,a mod b)-Generalized Euclidean algorithm for computing the greatest common divisor of two numbers, relying on Theorem Theorem: gcd (a, b) = gcd (b, a the mod b)
gcd
- 最大公约数程序，使用多种方法来计算最大公约数-The greatest common divisor of the program, using a variety of methods to calculate the greatest common divisor