AMC 10 Step by Step

2016 AMC 10B Problem 18

P16-20~5 minPrint

In how many ways can 345345 be written as the sum of an increasing sequence of two or more consecutive positive integers?

Log in to save your progress.
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 kk numbers and starts at aa: a+(a+1)+⋯+(a+k−1)a + (a + 1) + \cdots + (a + k - 1).
2. The average of evenly spaced numbers is the average of the first and last, a+(a+k−1)2\frac{a + (a + k - 1)}{2}. The sum is the count times the average:
345=k⋅2a+k−12,sok(2a+k−1)=690.345 = k \cdot \frac{2a + k - 1}{2}, \qquad \text{so} \qquad k(2a + k - 1) = 690.

Step 2: turn it into factor pairs.

  1. So 690690 is split into two factors: kk and m=2a+k−1m = 2a + k - 1.
  2. Since a≥1a \ge 1, the factor mm is bigger than kk. So kk is the smaller factor of the pair.
  3. Once you pick the pair, the start is a=m−k+12a = \frac{m - k + 1}{2}. This is a whole number when m−km - k is odd, that is, when one factor is even and the other odd.
  4. 690=2⋅3⋅5⋅23690 = 2 \cdot 3 \cdot 5 \cdot 23 has only one factor of 22. So in every factor pair, one factor is even and the other odd. Every pair works.

Step 3: list the pairs.

kk1122335566101015152323
mm690690345345230230138138115115696946463030
start aa345345172172114114676755553030161644
  1. The pair with k=1k = 1 is just "345345" by itself, which is not two or more numbers. Throw it out.
  2. The other 77 pairs each give a run. For example, k=2k = 2 gives 172+173172 + 173, and k=23k = 23 gives 4+5+⋯+264 + 5 + \cdots + 26.

The answer is (E) 7\boxed{\textbf{(E)}\ 7}.

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 2×3452 \times 345 with one even and one odd factor gives one run. A shortcut to remember: this count equals the number of odd divisors of 345345 (here 88), minus 11 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 345=a+(a+1)+⋯+(a+k−1)345 = a + (a+1) + \cdots + (a + k - 1) with k≥2k \ge 2 terms and first term a≥1a \ge 1. The sum of kk terms is kk times the average of the first and last, so
345=k (2a+k−1)2⟹k (2a+k−1)=690.345 = \frac{k\,(2a + k - 1)}{2} \quad\Longrightarrow\quad k\,(2a + k - 1) = 690.

The second factor 2a+k−12a + k - 1 exceeds kk (since 2a−1≥12a - 1 \ge 1), so kk is the smaller factor in a factor pair of 690=2⋅3⋅5⋅23690 = 2 \cdot 3 \cdot 5 \cdot 23. The factor pairs are
(1,690), (2,345), (3,230), (5,138), (6,115), (10,69), (15,46), (23,30).(1, 690),\ (2, 345),\ (3, 230),\ (5, 138),\ (6, 115),\ (10, 69),\ (15, 46),\ (23, 30).
For each pair, a=m−k+12a = \frac{m - k + 1}{2} where mm is the larger factor; this is a positive integer exactly when m−km - k is odd. Since 690690 has a single factor of 22, one factor in every pair is even and the other odd, so every pair works.

Discard (1,690)(1, 690), which is the trivial one-term sum. The remaining 77 pairs each give a valid run, for instance k=2k = 2: 172+173172 + 173, and k=23k = 23: 4+5+⋯+264 + 5 + \cdots + 26.

The answer is (E) 7\boxed{\textbf{(E)}\ 7}.

Review in the AoPS books

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.