have 7 friends, 2 tickets to the concert of the century, and I can’t go! I could give the tickets to friend #1 and #2, or #1 and #3, etc. How many different options are there? I've decided to make them vie for the tickets using a single elimination knock-out ping pong tournament. How many matches will I need to have?
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.
I have 7 friends, 2 tickets to the concert of the century, and I can’t go!
I could give the tickets to friend #1 and #2, or #1 and #3, etc. How many different options are there?
I've decided to make them vie for the tickets using a single elimination knock-out ping pong tournament. How many matches will I need to have?
Step by step
Solved in 2 steps
