Three red beads, two white beads, and one blue bead are placed in line in random order. What is the probability that no two neighboring beads are the same color?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Place the three red beads first. They cannot touch, so they fit only four ways in six spots. Then check where the white and blue beads can go.
Solution
Beads of the same color look alike, so count color patterns (like RWRBRW). Every pattern is equally likely.
All patterns.
- Choose of the spots for red: ways. Then choose of the spots left for blue: ways. White fills the last two.
- Total: patterns.
Good patterns. The three reds are the hardest to keep apart, so place them first.
3. The reds need three spots from to with no two next to each other. The only choices are
4. Reds in : the open spots are not next to each other, so the two whites can never touch. Blue can take any of the open spots: patterns.
5. Reds in : same reasoning, patterns.
6. Reds in : the open spots are , and are neighbors. The whites cannot both go there, so blue must take or : patterns.
7. Reds in : the open spots are , and are neighbors. Blue must take or : patterns.
8. Good patterns: .
The probability is .
The answer is .
Why this works
The color with the most beads has the fewest ways to be spread out, so placing it first leaves only a few small cases. Counting color patterns is fine as long as you count the same way on top and bottom of the fraction: every color pattern stands for the same number of orderings of the actual beads (), so the ratio does not change.
Alternative approach
Count real beads instead of patterns, treating all six as different. There are orderings. Each good color pattern can be filled by the actual beads in (reds) (whites) ways, giving good orderings. The probability is , the same answer.
The trap
Using 720 orderings as the total while counting color patterns for the good cases. Count color patterns for both, and there are 60 of them.
Concise solution
Beads of the same color are indistinguishable, so the equally likely outcomes are the color patterns, of which there are
The three reds are the tightest constraint: they must occupy three pairwise non-adjacent positions among through . The only such triples are , , and .
- Reds in or : the remaining positions are also pairwise non-adjacent, so the whites can never touch. The blue may go in any of the open slots: patterns each, total.
- Reds in : open slots , and are adjacent. The two whites must not both land there, so the blue must be in or : patterns.
- Reds in : open slots ; by the same reasoning the blue is in or : patterns.
Favorable patterns: , so the probability is .
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Counting & Probability, Chapter 8: Basic Probability Techniques
Techniques
Organized listing / direct enumeration · Split into exhaustive cases and handle each