![]()
![]()
![]()
Next: Remainders and Euclid's Algorithm Up: Divisibility and Remainders Previous: Basic Notions.
Relatively Prime Numbers.
Two numbers are called relatively prime or co-prime if they have no common divisors greater than 1.
The following facts are easy to prove and often used:
- 1.
- If some natural number is divisible by two relatively prime numbers p and q, then it is divisible by their product pq.
- 2.
- If the number pA is divisible by q, where p and q are relatively prime, then A is also divisible by q.
We introduce two more important definitions:
- 1.
- The Greatest Common Divisor
of two natural numbers x and y, and
- 2.
- The Least Common Multiple lcm(x,y)
Here are some exercises on these:
Problem 4. Find gcm(A,B) of the numbers
and
and lcm(C,D) of the numbers
and
.
Answer.
, and
.
Math Circle
1999-08-22