Let and be relatively prime positive integers with and . What is ?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Cancel one factor of a - b, write a^2 + ab + b^2 as (a-b)^2 + 3ab, and get 9ab = 70(a-b)^2; coprimality forces (a-b)^2 to divide 9.
Solution
Factor the numerator: . Cancelling one factor of ,
Let . Since , the equation becomes
Now use coprimality. Any common divisor of and also divides , so ; likewise . Hence shares no factor with , and forces , so or .
If , then , impossible. If , then with : the pair , works, and .
Check: .
The answer is .
Why this works
The difference-of-cubes identity plus the substitution turns a messy fraction into the clean relation . The "relatively prime" hypothesis is there to be used: it makes coprime to , so all of must sit inside the . Look for this pattern whenever a condition mentions .
Alternative approach
Test the answer choices in : must be a multiple of (since ), leaving only among the choices, and , gives .
The trap
Forgetting that gcd(a, b) = 1 implies gcd(a - b, ab) = 1, and so failing to conclude that d must divide 3 (or accepting d = 1 without checking that 9ab = 70 has no solution).
Common mistakes
- Forgetting that gcd(a, b) = 1 implies gcd(a - b, ab) = 1, and so failing to conclude that d must divide 3 (or accepting d = 1 without checking that 9ab = 70 has no solution).
- Expanding fully and trying to solve a cubic instead of cancelling the common factor first.
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Substitute to simplify (u = x+1/x, shifting, scaling)