OpenStax, Algebra and Trigonometry 2e §13.5 Counting Principles · Exercise 4 · Combinatorics · Permutations & combinations
Counting Principles · Exercise 4
Solve counting problems using the multiplication principle.
How many two-letter strings—the first letter from set A and the second letter from set B can be formed from the sets A = {b, c, d} and B = {a, e, i, o, u}?
Its source prints no answer for this problem, so there's nothing to check against.
OpenStax, Algebra and Trigonometry 2e · §13.5 Counting Principles · Exercise 4
Stuck? A gentle nudge
No hints for this one.
Your working
Check your full solution
Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.