All of David's telephone numbers have the form , where , , , , , , and are distinct digits and in increasing order, and none is either or . How many different telephone numbers can David have?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
An increasing string of 7 distinct digits is determined by which 7 of the 8 allowed digits are used, i.e. which single digit is left out.
Solution
The allowed digits are : eight of them. The seven positions through must be filled with seven distinct allowed digits.
Once we decide which seven digits to use, the increasing-order requirement leaves only one way to place them. So a telephone number corresponds exactly to a choice of digits out of , or equivalently to the one digit that is omitted.
There are digits that could be the omitted one, so there are telephone numbers.
The answer is .
Why this works
"Distinct and in increasing order" is a signal that order carries no information: the set of digits determines the string. Counting sets instead of strings turns a permutation-flavored problem into a combination, and is easiest read as "pick the one left out."
The trap
Counting arrangements of the digits (permutations) when the increasing-order condition fixes the arrangement completely.
Common mistakes
- Counting arrangements of the digits (permutations) when the increasing-order condition fixes the arrangement completely.
- Miscounting the allowed digits as or (forgetting that both and are excluded, or dropping ).
Techniques
Map the objects to something easier to count