Probability & Statistics · Probability Foundations
Counting — Practice Problems and Worked Solutions
Count selections and arrangements without brute force.
The formulas you need here
Combinations and permutations
- What it says
- Combinations ignore order; permutations count it.
- When to reach for it
- Counting outcomes before any probability can be computed.
- Watch out
- Ask whether rearranging the same items counts as a new outcome. If not, it is a combination.
Ten possible pairs from five people, since a pair has no order.
17 worked problems
Every step is generated and checked by a computer algebra system.
- 1.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 2.
Count the number of possible selections.
Answer:
Step-by-step solution
- 3.
Count the number of possible selections.
Answer:
Step-by-step solution
- 4.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 5.
Count the number of possible selections.
Answer:
Step-by-step solution
- 6.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 7.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 8.
Count the number of possible selections.
Answer:
Step-by-step solution
- 9.
Count the number of possible selections.
Answer:
Step-by-step solution
- 10.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 11.
Count the number of possible selections.
Answer:
Step-by-step solution
- 12.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 13.
Count the number of possible selections.
Answer:
Step-by-step solution
- 14.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 15.
Count the number of possible selections.
Answer:
Step-by-step solution
- 16.
Count the number of ordered arrangements.
Answer:
Step-by-step solution
- 17.
Count the number of possible selections.
Answer:
Step-by-step solution