<< Chapter < Page | Chapter >> Page > |
In the game of “Solitaire” (also known as “Patience” or “Klondike”), seven cards are dealt out at the beginning, as shown to the left: one face-up, and the other six face-down. (A bunch of other cards are dealt out too, but let’s ignore that right now.)A complete card deck has 52 cards. Assuming that all you know is the 7 of spades showing, how many possible “hands” (the other six cards) could be showing underneath?What makes this a “permutations” problem is that order matters : if an ace is hiding somewhere in those six cards, it makes a big difference if the ace is on the first position, the second, etc . Permutations problems can always be addressed as an example of the multiplication rule, with one small twist. |
This result can be expressed (and typed into a calculator) more concisely by using factorials .
A “factorial” (written with an exclamation mark) means “multiply all the numbers from 1 up to this number.” So 5! means .
What is ? Well, it is , of course. Most of the terms cancel, leaving only .
And what about ? If you write out all the terms, you can see that the first 45 terms cancel, leaving , which is the number of permutations we want. So instead of typing into your calculator six numbers to multiply (or sixty numbers or six hundred, depending on the problem), you can always find the answer to a permutation problem by dividing two factorials. In many calculators, the factorial option is located under the “probability” menu for this reason.
Notification Switch
Would you like to follow the 'Advanced algebra ii: conceptual explanations' conversation and receive update notifications?