Back to Exercise: Use permutations and combinations to compute probabilities

Exercises: Use Permutations and Combinations to Compute Probabilities

Work through each section in order. Before computing a count, ask the deciding question: "If I swap two of my chosen items, is it a DIFFERENT outcome?" If yes, order matters — use a permutation, nPr = n!/(n - r)!. If no, order does not matter — use a combination, nCr = nPr / r! = n!/(r!(n - r)!). For probabilities, count the favorable and the total the SAME way (both ordered or both unordered).

Grade 11·20 problems·~35 min·Common Core Math - HS Statistics and Probability·group·hss-cp-b-9
Work through problems with immediate feedback
A

Warm-Up: Counting Principle, Factorials, and Order

These problems review the counting building blocks.

1.

A deli offers 3 kinds of bread and 5 kinds of filling. A sandwich is one bread and one filling. By the Fundamental Counting Principle, how many different sandwiches are possible?

2.

Compute the factorial $5!$ ($5! = 5 \times 4 \times 3 \times 2 \times 1$).

3.

You choose 3 people from a group. In which situation does ORDER MATTER (so swapping two chosen people gives a different outcome)?

B

Fluency Practice

Compute each count. Cancel factorials before multiplying out.

1.

A 4-character password uses one digit (0-9) for each character, repeats allowed. By the counting principle, how many passwords are possible? (Enter the number.)

2.

Compute the permutation 8P3=8!(83)!=8!5!_8P_3 = \dfrac{8!}{(8-3)!} = \dfrac{8!}{5!}.

3.

Compute the combination 8C3=8P33!=8!3!(83)!_8C_3 = \dfrac{_8P_3}{3!} = \dfrac{8!}{3!\,(8-3)!}.

4.

A shelf will hold 4 of 7 distinct books arranged left to right. How many arrangements are possible? Compute 7P4_7P_4.

5.

How many different 3-topping pizzas can be made from 6 available toppings, if no topping is repeated and order does not matter? Compute 6C3_6C_3.

You're viewing 2 of 6 sections.

Create a free account to continue the full exercise set and save your progress.

Create free account
0 of 8 answered

Answer all problems to submit.