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
Numbers 8 to 14 can never be the smaller one in a pair, so they are the seven larger numbers. Pair 7 first, then 6, 5, 4.
Solution
Step 1: which numbers can be the smaller one in a pair? If is the smaller number, its partner is at least , and the partner is at most . So , which means .
So are always the larger number of their pair. That is numbers, and there are exactly pairs, each with one larger number. So the larger numbers are exactly through , and the smaller numbers are exactly through . Every pair has one number from each group.
Step 2: list the allowed partners.
| Smaller number | Allowed partners |
|---|---|
| to | |
| to | |
| to |
Step 3: match the pickiest number first. Each list contains the one above it, so every partner already taken is always in the current list, and we can simply subtract.
- : choice ().
- : allowed, already taken: choices.
- : allowed, taken: choices.
- : allowed, taken: choices.
- , , : the partners left can go to them in ways.
Step 4: multiply. .
The answer is .
Why this works
When items have different numbers of options, place the most restricted one first. Here the lists of allowed partners sit inside each other, so going from down to each step loses exactly one option per earlier pick. Every count is then a fixed number, and the multiplication principle works with no cases.
The trap
Starting the pairing with 1, where the number of choices depends on earlier picks, instead of with 7, which has only one possible partner.
Concise 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 .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 3: Correcting for Overcounting (§3.2, §3.4)
- Introduction to Counting & Probability, Chapter 4: Committees and Combinations
Techniques
Set up the equation/formula and compute; no special trick needed · Consider the largest/smallest element or boundary case