When fair standard -sided dice are thrown, the probability that the sum of the numbers on the top faces is can be written as where is a positive integer. What is ?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Each die shows at least 1, so seven dice already give 7. Only 3 extra points are left to hand out, and there are just three ways to split 3.
Solution
All outcomes are equally likely, so is just the number of ordered results (die 1, die 2, ..., die 7) whose total is .
1. Start from the smallest total. Every die shows at least , so the smallest possible total is . To reach we need extra points on top of the seven s.
2. How can extra points be shared out? There are only three patterns:
- one die gets all extra (it shows , the rest show );
- one die gets extra and another gets (they show and );
- three different dice get extra each (they show , , ).
No die ever goes above , so the limit of on a die never gets in the way.
3. Count each pattern.
- One die shows : choose which die, ways.
- One die shows and another shows : choices for the , then for the , so ways.
- Three dice show : choose which three of the seven dice. There are ways.
4. Add. .
The answer is .
Why this works
Taking away the every die must show turns "dice adding to " into "share extra points among dice", which is small enough to list by pattern. In each pattern, count by choosing which dice get the extras; the order matters because the dice are different. Always check whether the top limit ( on a die) can be reached; here it cannot.
Alternative approach
Stars and bars. Picture the extra points as stars, and split them among dice using bars as dividers. Any row of stars and bars gives one way to share the points (the stars before the first bar go to die 1, and so on). A row has spots, and we choose of them for the stars: .
The trap
Forgetting that a die can never show 0, and counting ways for seven numbers from 0 up to add to 10, which gives a much bigger wrong count.
Concise solution
There are equally likely ordered outcomes, so is simply the number of ordered -tuples with each and .
Each die shows at least , so set . The condition becomes
The upper bound is automatic: no can exceed , so no die exceeds , well under . We are simply distributing identical pips among dice.
By stars and bars, stars and bars can be arranged in
ways.
The answer is .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 7: Distributions (§7.2, §7.3)
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Intermediate Counting & Probability, Chapter 4: Constructive Counting and 1-1 Correspondences (§4.4, §4.5, §4.6)
- Introduction to Counting & Probability, Chapter 5: More With Combinations (§5.4)
Techniques
Map the objects to something easier to count