Difference between revisions of "Common divisor"
m |
|||
| Line 1: | Line 1: | ||
A '''common divisor''' of two or more [[integer | integers]] is a [[divisor]] of all those integers. For any [[set]] of [[positive integer]]s, there is a [[greatest common divisor]]. | A '''common divisor''' of two or more [[integer | integers]] is a [[divisor]] of all those integers. For any [[set]] of [[positive integer]]s, 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 two numbers is 1. | ||
{{stub}} | {{stub}} | ||
Revision as of 12:11, 23 September 2007
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 two numbers is 1.
This article is a stub. Help us out by expanding it.
