How many ways are there to split the integers through into pairs such that in each pair, the greater number is at least times the lesser number?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
8-14 must be the larger members, so 1-7 are the smaller; pair 7, 6, 5, 4 first (1, 2, 3, 4 options), then 3, 2, 1 freely.
Solution
A number can be the smaller member of a pair only if , so must all be the larger members. That is seven numbers, and there are exactly seven pairs, so the larger members are precisely through and the smaller members are precisely through .
Each of must be matched with a number from at least twice as large. Match the most restricted numbers first:
- : only works. choice.
- : minus the one already used. choices.
- : through minus two used. choices.
- : through minus three used. choices.
- : any of the remaining three, in turn. choices.
Total: .
The answer is .
Why this works
The allowed partners of form nested sets: whatever a larger number may take, a smaller number may also take. Matching in decreasing order of the smaller member therefore removes exactly one option per step from each later set, so the count at each step is fixed and the multiplication principle applies with no casework.
The trap
Assigning partners starting from 1, where the number of available choices depends on earlier picks, instead of starting from the most constrained number 7.
Common mistakes
- Assigning partners starting from 1, where the number of available choices depends on earlier picks, instead of starting from the most constrained number 7.
- Overlooking that must be a smaller member (since through already fill all seven "larger" slots) and allowing pairs like .
Techniques
Set up the equation/formula and compute; no special trick needed · Consider the largest/smallest element or boundary case