An arithmetic sequence of positive integers has terms, initial term , and common difference . Carl wrote down all the terms in this sequence correctly except for one term, which was off by . The sum of the terms he wrote down was . What is ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
The true sum is 221 or 223, so n divides 442 or 446; d >= 2 forces n <= 14, leaving n = 13, d = 2, a = 5.
Solution
One term was off by , so the true sum is or . For an arithmetic sequence,
Because and , the second factor satisfies , so and .
Case : , and is prime. The only divisors of below are and , but . No solution.
Case : . Its divisors below are , so . Then , i.e. . With : gives ; makes negative. So , , .
Check: the sequence has sum , and one wrong term makes .
Therefore .
The answer is .
Why this works
The sum formula makes a divisor of , and the constraints , give a cheap upper bound . Factoring the two candidate values of then leaves almost nothing to check. Problems of the form "someone made a small error" are solved by listing the possible true values and letting divisibility choose among them.
The trap
Using 222 as the actual sum of the sequence; Carl's total is off by 1, so the real sum is 221 or 223.
Common mistakes
- Using 222 as the actual sum of the sequence; Carl's total is off by 1, so the real sum is 221 or 223.
- Forgetting , which admits the solution , , (or , , ) and a wrong total.
Techniques
Bound the quantity above/below or estimate to pin it down · Split into exhaustive cases and handle each