There is a class consisting of 20 students. In how many different ways can these 20 students be split into 10 pairs?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Imagine these 2 0 students lined up in a row. Now the first person in the row can be paired up with any of the other 1 9 students. That's 1 9 ways. For each of these ways, look at the first person left in the row who has not yet been partnered up. That student has 17 ways to partner someone. So the first two pairings can be done in 1 9 ∗ 1 7 ways. For each of these ways, the first student in the row who doesn't have a partner can be paired up in 15 ways and so on. So thats 1 9 ∗ 1 7 ∗ 1 5 ∗ 1 3 ∗ 1 1 ∗ 9 ∗ 7 ∗ 5 ∗ 3 ∗ 1 = 6 5 4 7 2 9 0 7 5 ways.
Another way of solving. We can select a pair in 2 0 C 2 ways. Then the next pair in 1 8 C 2 ways, and the next in 1 6 C 2 ways. and so on on till 2 C 2 . That's 2 0 C 2 ∗ 1 8 C 2 ∗ 1 6 C 2 ∗ . . . . . . . ∗ 2 C 2 . However we are over-counting because we aren't interested in the order in which we picked the pairs. So we must divide by by the number of orderings in which you could have picked any set of ten pairs, and that's the number of permutations of ten objects, which is 10!