搜索资源列表
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_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
013
- 通过字符串操作模拟控制台的cd命令，要求至少完成 “cd 【目录名】”、“cd ..” 和“cd \” 三个命令。实例可以参考:开始->运行->cmd->键入上述三个命令观察提示符前的字符串变化，帮助可通过cd /?显示；可使用字符串处理函数。并用此程序练习和熟悉调试过程。 实验014：重写实验007和012，要求使用函数IsPrime实现判断一个数是否是素数，GCD返回两个数的最大公约数，LCM返回两个数的最小公倍数，并在main中调用。-Through the stri
lab2
- 定义一个分数类，用两个整数数据成员表示分数的分子和分母，成员函数包括求两个整数的最大公约数gcd()和最小公倍数lcm()的函数，再定义构造函数、获取分数、打印分数、实现分数四则运算的成员函数。 计算结果仍用分数表示并调用gcd()，lcm()成员函数化简-Define a fraction of class, with two integer data members of the numerator and denominator of the fraction, member functi
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
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
GCD-and-LCM
- a simple program getting two numbers and calculating the GCD and LCM for them
1-(a-b)
- 此程序为利用广义欧几里德算法求解最大公约数GCD-This procedure for the use of the generalized Euclidean algorithm for solving the greatest common divisor GCD
hdlsrc
- In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more integers(at least one of which is not zero), is the largest positive integer that divides the numbers wi
based-on-Euclid
- 自己以前写的基于欧几里得的小程序。 1.判断一个整数是不是素数 2.计算两个整数的最大公约数 3.计算两个整数的最小公倍数 4.将输入的a,b表示成s*a+t*b=gcd(a,b)的形式 5.求输入的a,m中a模m的逆元-A small program based on Euclid . 1. Determine an integer is not a prime number 2 Calculate
hw-gcd
- 华为2014编程大赛的一道编程题，求多个整数的最大公约数-Huawei s 2014 programming contest a programming problem, find the greatest common divisor of multiple integers
Mathematical_method
- 整数算法的相关实现，有素数的判断，最大公因数，最小公倍数，同余方程组求解，欧拉算法实现，一次多元方程组求解-Implementation of integer arithmetic, a prime judgment, GCD, LCM, solving the Congruence Equations, Euler algorithm, a multivariate equations
LCM-a-GCD
- LCM & GCD Function -LCM & GCD Function .....