2016 AMC 10B Problem 18
In how many ways can be written as the sum of an increasing sequence of two or more consecutive positive integers?
Show solution without answering
Key insight
A run of k consecutive numbers starting at a adds to k(2a + k - 1)/2. So k(2a + k - 1) = 690: count factor pairs of 690.
Solution
Step 1: a formula for the sum.
1. Suppose the run has numbers and starts at : .
2. The average of evenly spaced numbers is the average of the first and last, . The sum is the count times the average:
Step 2: turn it into factor pairs.
- So is split into two factors: and .
- Since , the factor is bigger than . So is the smaller factor of the pair.
- Once you pick the pair, the start is . This is a whole number when is odd, that is, when one factor is even and the other odd.
- has only one factor of . So in every factor pair, one factor is even and the other odd. Every pair works.
Step 3: list the pairs.
| start |
- The pair with is just "" by itself, which is not two or more numbers. Throw it out.
- The other pairs each give a run. For example, gives , and gives .
The answer is .
Why this works
A sum of consecutive whole numbers is "how many numbers" times "the average," which turns the question into a factoring question. Each factor pair of with one even and one odd factor gives one run. A shortcut to remember: this count equals the number of odd divisors of (here ), minus for the one-number run.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Suppose with terms and first term . The sum of terms is times the average of the first and last, so
The second factor exceeds (since ), so is the smaller factor in a factor pair of . The factor pairs are
For each pair, where is the larger factor; this is a positive integer exactly when is odd. Since has a single factor of , one factor in every pair is even and the other odd, so every pair works.
Discard , which is the trivial one-term sum. The remaining pairs each give a valid run, for instance : , and : .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Introduction to Algebra, Chapter 11: Special Factorizations
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.