# Difference between revisions of "Common divisor"

(see also) |
I like pie (talk | contribs) m |
||

Line 3: | Line 3: | ||

==Problems== | ==Problems== | ||

===Introductory=== | ===Introductory=== | ||

− | *Find the greatest common divisor of 12, 99, and 111. | + | * Find the greatest common divisor of 12, 99, and 111. |

===Intermediate=== | ===Intermediate=== | ||

− | *Prove that the greatest common divisor of two numbers times the least [[common multiple]] of those two numbers is equal to the product of the two numbers. | + | * Prove that the greatest common divisor of two numbers times the least [[common multiple]] of those two numbers is equal to the product of the two numbers. |

== See also == | == See also == | ||

− | *[[Euclidean algorithm]] | + | * [[Euclidean algorithm]] |

+ | * [[Common multiple]] | ||

+ | * [[Least common multiple]] | ||

{{stub}} | {{stub}} |

## Revision as of 11:12, 19 April 2008

A **common divisor** of two or more integers is a divisor of all those integers. For any set of positive integers, there is a greatest common divisor.

## Problems

### Introductory

- Find the greatest common divisor of 12, 99, and 111.

### Intermediate

- Prove that the greatest common divisor of two numbers times the least common multiple of those two numbers is equal to the product of the two numbers.

## See also

*This article is a stub. Help us out by expanding it.*