|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Home : Math & Science : Math Study Guides : Algebra II : Discrete Functions : Permutations and Combinations
Permutations and Combinations
The Permutation Function
Examples:
The permutation function yields the number of ways that n distinct items can
be arranged in k spots. For example, P(7, 3) =
= 210. We can
see that this yields the number of ways 7 items can be arranged in 3 spots --
there are 7 possibilities for the first spot, 6 for the second, and 5 for the
third, for a total of 7(6)(5):
P(7, 3) =
= 7(6)(5).
Example: The coach of a basketball team is picking among 11 players for the 5 different positions in his starting lineup. How many different lineups can he pick?
P(11, 5) =
= = 55440 different lineups.
The Combination Function
Examples:
The combination function yields the number of ways n distinct items can be
chosen for k spots, when the order in which they are chosen does
not matter--that is, choosing ABCDE is equivalent to choosing BAEDC. In other words, we use
the combination function when all spots are equivalent.
Example: If Jim has 12 shirts, and needs to pack 7 for vacation, how many different combinations of shirts can he pack?
C(12, 7) =
= 792 different combinations of shirts.
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Contact Us | Privacy Policy | Terms and Conditions | About
©2006 SparkNotes LLC, All Rights Reserved.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||