An array of numbers is constructed beginning with the numbers in the top row. Each adjacent pair of numbers is summed to produce a number in the next row. Each row begins and ends with and , respectively.
If the process continues, one of the rows will sum to . In that row, what is the third number from the left?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
Each row sum doubles, since every entry is used twice except the fixed ends that restore it, so S_n = 3 * 2^(n-1) and 12,288 is row 13.
Solution
Which row. Let row be with and , and let be its sum. Row consists of , then the pairwise sums , then . In those pairwise sums every entry of row appears twice except the two ends, which appear once, so they total
and the appended and cancel. Hence
With we get ; the printed rows check this (). Since , we need , so it is row .
The third entry. Write and for the second and third entries of row . From the construction,
Starting from , the first recursion gives . Then
Checking against the picture: and , as printed.
For ,
The answer is .
Why this works
The two halves of the problem are the same trick applied twice: a rule that builds each row from the previous one gives a recursion, and a recursion whose step is constant or linear can be summed in closed form. The row sum obeys because the "sum adjacent pairs" operation always doubles a sum apart from the boundary, and here the boundary is rigged to contribute nothing. Only the first three entries of a row are ever needed, and each of them depends only on entries at least as far left, so a two-term recursion suffices; there is no need to write out whole rows. The same set-up governs any Pascal-like array with forced ends.
Alternative approach
Tabulate only the second and third entries, one row per line, starting from :
The thirteenth pair gives . Note that the last five third entries are exactly the five answer choices in reverse, which is the examiners' way of punishing an off-by-one in the row number.
The trap
Reading 12,288 = 3 * 2^12 as row 12 instead of row 13, which gives the third entry -21, choice (B).
Common mistakes
- Reading 12,288 = 3 * 2^12 as row 12 instead of row 13, which gives the third entry -21, choice (B).
- Assuming the row sums are only by inspection of the three printed rows and never checking why; the doubling needs the fact that the two end entries are and .
- Recomputing whole rows down to row , which is slow and invites an arithmetic slip in the growing middle entries.
Techniques
Compute small cases, spot the pattern, generalize · Define states/recurrence and iterate