Difference between revisions of "Common divisor"
m |
(→See also) |
||
| (6 intermediate revisions by 4 users not shown) | |||
| 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 those two numbers is equal to the product of the two numbers. | ||
| + | |||
| + | == See also == | ||
| + | * [[Euclidean algorithm]] | ||
| + | * [[Common multiple]] | ||
| + | * [[Greatest common divisor]] | ||
Latest revision as of 09:14, 14 October 2025
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.
