Combining Letters into Words
It is possible to use the Law of Combining even if the two "sets" are actually identical. For example, you might want to know how many two letter words there are in the English language (or you might not, but humor me here).
To simplify matters, let's assume that ANY combination of two letters is a word, regardless of whether it contains a vowel or not.
In this case, "set 1" contains all the letters in the English alphabet. So does "set 2".
So the number of words is:
Think for a minute about these questions:
1. Does it matter what order you pick the letters?
2. Does it count if you pick the same letter twice?
How many 5-letter words could be made?
(To make this problem interactive, turn on javascript!)
- I need a hint ... : Although the phrase contains 22 letters, several are repeated. There are only 14 distinct letters.
I think I have the answer: 537,824 =(14*14*14*14*14)
Sometimes hitting the multiplication key so many times gets to be a bit tedious...
How many 12 letter combinations are possible?
(To make this problem interactive, turn on javascript!)
- I need a hint ... : typing 14*14*14*14*14*14*14*14*14*14*14*14 into Google (or a calculator)
is tedious... there must be an easier way.
- ...another hint ... : multiplying something by itself 12 times is the same as raising to the 12th power.
- ...another hint ... : for Google: Use the "^" key to get a power, like this: "14^12="
I think I have the answer: 5.67 × 1013
This is a good trick to remember: if you are making a string of choices from the same set, then instead of multiplying repeatedly, you can simply use a power. If we want to make a 12 letter word, and we have 14 letters available to us, we can do this:
14*14*14*14*14*14*14*14*14*14*14*14 = 5.67 × 1013
to figure out how many possible words we could make, or we could simply do this:
14^12 = 1412 = 5.67 × 1013
The first way is a little easier to understand -- it almost looks like a 9-"letter" word. But the second way is a lot faster to calculate.
Copyright University of Maryland, 2007
You may link to this site for educational purposes.
Please do not copy without permission
requests/questions/feedback email: mathbench@umd.edu