Noun
an integer that divides two (or more) other integers evenly
Source: WordNetA prototypical example of an algorithm is Euclid's algorithm to determine the maximum common divisor of two integers; an example (there are others) is described by the flow chart above and as an example in a later section. Source: Internet
Divide both a and b by 2, increment d by 1 to record the number of times 2 is a common divisor and continue. Source: Internet
Equivalently, n is prime if and only if all integers m satisfying 2 ≤ m ≤ n − 1 are coprime to n, i.e. their only common divisor is one. Source: Internet
If two numbers have no prime factors in common, their greatest common divisor is 1 (obtained here as an instance of the empty product ), in other words they are coprime. Source: Internet
Footnote 27, p. 9: "For example, the natural numbers with gcd (greatest common divisor) as meet and lcm (least common multiple) as join operation determine a (complete distributive) lattice." Source: Internet
As in the previous case 2 is not a common divisor. Source: Internet