Brian writes down four integers whose sum is . The pairwise positive differences of these numbers are and . What is the sum of the possible values for ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
The largest difference 9 is w - z, so the three consecutive gaps are three listed differences summing to 9; only {1, 3, 5} works, in two orders.
Solution
Write the consecutive gaps as , , . The six pairwise differences are then , and . The biggest of the six is , so .
The three gaps are three of the numbers adding to . The only such triple is (for instance already, and likewise, leaving no room for a third positive gap).
Now decide the order. The two-step sums and must be the remaining differences and . If sat in the middle, one two-step sum would be and the other , which is not allowed. So the middle gap , and or ; both give two-step sums and .
- Gaps : the numbers are , sum , so and .
- Gaps : the numbers are , sum , so and .
Both lists ( and ) really do have differences . The sum of the possible values of is .
The answer is .
Why this works
For an ordered list, every pairwise difference is a sum of consecutive gaps, and the largest difference is the total spread. Pinning down the extreme difference first collapses the search to choosing three gaps with a fixed sum, and the two-step sums then test each ordering. The final sum condition is a one-variable linear equation.
Alternative approach
Since and lie strictly between, write and note . Trying small and listing which pairs inside produce exactly the six required differences quickly finds and and nothing else.
The trap
Stopping after finding one valid arrangement of the gaps (w = 16 or w = 15) and reporting that single value instead of the sum of both.
Common mistakes
- Stopping after finding one valid arrangement of the gaps ( or ) and reporting that single value instead of the sum of both.
- Forgetting that the middle gap must combine with both neighbors to give listed differences, and accepting an order like whose two-step sum is not in the list.
- Assuming the differences are listed in some order that corresponds to positions, rather than treating them as an unordered set.
Techniques
Split into exhaustive cases and handle each · Consider the largest/smallest element or boundary case