Greatest common divisor
From Maths
Note: requires knowledge of what it means for a number to be a divisor of another.
Definition
Given two positive integers, a,b∈N+, the greatest common divisor of a and b[1] is the greatest positive integer, d, that divides both a and b. We write:
- d=gcd(a,b)
Terminology
Co-prime
If for a,b∈N+ we have gcd(a,b)=1 then a and b are said to be co-prime[1]
See next
See also
References
- ↑ Jump up to: 1.0 1.1 The mathematics of ciphers, Number theory and RSA cryptography - S. C. Coutinho