Permutations & Combinations
11 practice questions with full worked solutions. Free, no account needed.
Problems & worked solutions
Problem 1 — Permutations & Combinations
The value of is:
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
.
Problem 2 — Permutations & Combinations
The number of ways to arrange distinct books on a shelf is:
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
.
Problem 3 — Permutations & Combinations
A menu offers appetizers, mains, and desserts. The number of distinct three-course meals is:
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
.
Problem 4 — Permutations & Combinations
The number of -letter codes that can be formed using letters from without repetition is:
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
.
Problem 5 — Permutations & Combinations
Determine , , such that .
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
. Only is admissible.
Problem 6 — Permutations & Combinations
The number of -element subsets of a -element set is:
Show answer & worked solution
- A.
- B. ✓ correct
- C.
- D.
.
Problem 7 — Permutations & Combinations
The sum of all distinct three-digit numbers that can be formed using the digits is:
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
The three distinct numbers are . Sum .
Problem 8 — Permutations & Combinations
The number of two-digit numbers with distinct digits formable from is:
Show answer & worked solution
- A.
- B. ✓ correct
- C.
- D.
, which is .
Problem 9 — Permutations & Combinations
At a meeting, every pair of people shakes hands exactly once. If there are handshakes total, how many people are there?
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
.
Problem 10 — Permutations & Combinations
Using Pascal's identity , compute .
Show answer & worked solution
- A.
- B.
- C. ✓ correct
- D.
By Pascal: .
