搜索资源列表
a223
- 此程式可輸入二個整數，並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
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 bits, int confidence, Random ran
最大值及最大公约数
- 求最大值及最大公约数。这是我初学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.
gcd
- Program to find GCD of two numbers using functions.
least_common.tar
- a linux program that enables to find the least common multiple of two integers. by means of this lcm, you can easiky find the gcd.
bianyi
- 汇编原理课设：主要有词法分析，语法分析，语义分析- A program to perform Euclid s Algorithm to compute gcd.
mimaxue
- 内含背包程序，RSA程序，中国剩余定理程序和GCD程序的源代码-Includes backpack program, RSA program, Chinese remainder theorem programs and GCD program' s source code
power shell
- A Sample program on Microsoft Powershell. It have functions of Mathematical functions such as GCD,
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
- 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
two-pgm.tar
- This a program which performs GCD of two numbers written in c-This is a program which performs GCD of two numbers written in c
front
- java写的类pascal编译器，实现program test(input, output) begin read(x, y) write(gcd(x, y)) end. -java pascal compiler writing class, to achieve program test (input, output) begin read (x, y) write (gcd (x, y)) end.
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
- this program is find the gcd of two number in 8086 microprocessor
gcd
- 求两个数的最大公约数，此程序用C语言编写，经测试没有问题。-For two of the largest number of companies, the program written in C, tested no problem.
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
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
gcd
- 求最大公约数是很多程序中需要出现的模块，本程序实现了欧几里得算法，计算最大公约数-Seeking the common denominator is the module needs to appear in many programs, the program implements the Euclidean algorithm to calculate the greatest common divisor
adder_4bit
- program using systemc synthesis GCD