How many ordered pairs of positive integers satisfy the equation where denotes the greatest common divisor of and , and denotes their least common multiple?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Write a = gx and b = gy, with g the gcd and x, y sharing no factor. Then 63 equals g times a whole number, so g divides 63.
Solution
An equation with gcd and lcm is easiest after pulling the gcd out of both numbers.
1. Pull out the gcd. Let . Then and , where and share no common factor (otherwise would not be the greatest). For example, , gives , , .
2. Rewrite each piece.
- .
- . (In the example, .)
3. Substitute.
Move the terms to one side:
4. So divides . The right side is times a whole number, so is one of . Dividing by :
5. Check each . Remember must be a positive whole number.
| left side | right side | result | |
|---|---|---|---|
| is not a multiple of | |||
| no | |||
| right side is positive, no | |||
| no | |||
| no |
6. Only works, with . The ways to write as are , and . But and share the factor , so that one is out. That leaves or , giving
7. Check. , and .
There are ordered pairs.
The answer is .
Why this works
Writing , with and sharing no factor turns gcd and lcm into ordinary multiplication. Then pulling out of the equation shows must divide a fixed number, so only a handful of cases need checking. Always remember the "no shared factor" rule when you rebuild and .
Alternative approach
Use the fact that . Write for the gcd and for the lcm. The equation becomes , which rearranges to
Try the factor pairs. and give , , and , so it works. , fails because is not a multiple of . The other pairs make smaller than or make a value negative. With and , the two numbers are and in either order.
The trap
Forgetting that x and y can share no factor, and counting x = y = 3 as a third solution; that pair has gcd 63, not 21.
Concise solution
Let and write , with . Then and . The equation becomes
So is a divisor of : , and .
- : , no.
- : , no.
- : , no.
- : , no.
- : , so with coprime: or .
- : , no.
The coprime factorizations of exclude , leaving two ordered pairs: and . Check: and .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Number Theory, Chapter 7: Algebra With Integers
- Intermediate Algebra, Chapter 20: Some Advanced Strategies (§20.2)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
Techniques
Split into exhaustive cases and handle each · Substitute to simplify (u = x+1/x, shifting, scaling)