A group of frends Anna (A), Bjorn (B), Candice (C), David (D) and Ellen (E) want to enter a basketball contest that caters for teams of different sizes. A team with n players is called an n-team. A player can be in several different teams, including teams of the same size. There is a restriction however: players in a 2-team cannot play together in any larger team. For example, if friends A,B,C,D form the teams AB, BCD, ACD, then they cannot also form the teams BD or ABC, among others.
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
A group of frends Anna (A), Bjorn (B), Candice (C), David (D) and Ellen (E) want to enter a basketball contest that caters for teams of different sizes. A team with n players is called an n-team. A player can be in several different teams, including teams of the same size. There is a restriction however: players in a 2-team cannot play together in any larger team. For example, if friends A,B,C,D form the teams AB, BCD, ACD, then they cannot also form the teams BD or ABC, among others.
Step by step
Solved in 2 steps with 8 images
