Difference between revisions of "Common divisor"

m (stubbed)
 
(4 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 integers, 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]]
  
 
{{stub}}
 
{{stub}}

Latest 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.

Invalid username
Login to AoPS