In a race among snails, there is at most one tie, but that tie can involve any number of snails. For example, the result might be that Dazzler is first; Abby, Cyrus, and Elroy are tied for second; and Bruna is fifth. How many different results of the race are possible?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Split by the size k of the single tie: choose the tied snails, then order the 6-k blocks: C(5,k)(6-k)!, plus 5! untied.
Solution
A result is an ordering of the five snails in which at most one group of snails shares a position. Classify by the size of the tied group.
- No tie. All finish in distinct places: .
- Tie of snails (). Choose the tied snails in ways. Treat them as a single block; together with the other snails there are blocks to order, in ways.
- :
- :
- :
- :
Total: .
The answer is .
Why this works
"At most one tie" means the result is an ordering of blocks where exactly one block may have size greater than . Casework on the size of that block, followed by "choose the members, then permute the blocks," is the standard way to count arrangements with a single glued group. The example in the statement (a three-way tie for second) is a hint that ties of any size are allowed.
Alternative approach
Sanity check with the choices: the total must end in because the no-tie, two-tie, three-tie and four-tie counts are all multiples of and the five-way tie adds . That leaves (B) and (D) , and alone already exceeds .
The trap
Forgetting the no-tie case (120) or the all-tied case (1), or ordering the tied snails among themselves as if a tie had an internal order.
Common mistakes
- Forgetting the no-tie case (120) or the all-tied case (1), or ordering the tied snails among themselves as if a tie had an internal order.
- Multiplying by or by instead of , which miscounts where the tied block can be placed.
Techniques
Split into exhaustive cases and handle each · Set up the equation/formula and compute; no special trick needed