The sum of the first positive odd integers is more than the sum of the first positive even integers. What is the sum of all possible values of ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
The sums are m^2 and n^2 + n; multiply by 4 and complete the square to get (2m)^2 - (2n+1)^2 = 847, then factor 847 = 7 * 11^2.
Solution
The first odd integers add to , and the first even integers add to . The condition reads
The right side is nearly a perfect square. Multiply by so that appears:
Factor ; its factor pairs are , and . On the left, the second factor is the larger one, so for each pair we set and . Subtracting gives , so and :
- : , .
- : , .
- : , .
All three are positive integers; for instance . The possible values of sum to .
The answer is .
Why this works
Two quadratics in different variables with equal leading coefficients become a difference of squares once each is completed; scaling by avoids fractions. That converts an equation with infinitely many candidate pairs into a finite list of factor pairs of a single constant. Whenever an integer equation has the shape , factor and enumerate.
Alternative approach
Put . Then must equal , so and . Testing (beyond that the numerator is negative), only give integers: . Same total, .
The trap
Using n^2 or n(n-1) for the sum of the first n even integers, or missing one of the three factor pairs of 847.
Common mistakes
- Using n^2 or n(n-1) for the sum of the first n even integers, or missing one of the three factor pairs of 847.
- Discarding the pair as "too big" and answering ; , is a legitimate solution.
- Assigning the larger factor to , which produces negative .
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Organized listing / direct enumeration