The number of ways to arrange 2n people into n named groups of two is
But these are not named groups so divide by (n!):
Lets assume all the people are males so I can call them "he" without feeling bad.
First I came up with the recursive definition, which is relatively easy, you know that the first person can pair with any of the people except himself (2n-1 options) and that will occupy person1 and person1's partner, leaving 2 fewer people, which leaves n-1 pairs. And then you can do that same step again. Now you know they are multiplied, because for every option that any of them chooses, the others can choose every available option. (if you are hazy on this, maybe take a look at trees, or just think about it for a while, or graphically draw the first few pairs, I drew n=3 on my paper to make sure there were really 15 options and I wasn't getting confused)
So my recursive formula looked like this:
Then I did 5 iterations, and saw the pattern:
f(1) = 1
f(2) = 3*1 = 3
f(3) = 5*3*1 = 15
f(4) = 7*5*3*1 = 105
f(5) = 9*7*5*3*1 = 945
And so the pattern is that it multiplies by the next consecutive odd integer. I played around with this for a while, and saw that I could look at it like this:
The numerator is simply 9! which is (2n-1)! and so I looked at the denominator for a while, and realized that if I divided those numbers by 2, I would have 4! Which means that if I multiplied 4! by I would have the denominator. Basically I made it look like this:
So now I had a formula for the numerator and the denominator, I put them together to get this:
Then I checked it and it worked. (I didn't prove it, though, so you might want to do that)
EDIT: After reviewing Plato's answer, I realized that you can modify our formula like this:
Now if we multiply by 2n on the top and bottom, we are multiplying by 1, and thus not changing the problem. This would cause the numerator to become 2n! instead of (2n-1)! because 2n is the next consecutive integer in the factorial. Then on the bottom, take the 2 and multiply it by the and you get and multiply the n by the and because it is the next consecutive integer in the factorial, it will become so:
modify the formula
Angel White... That was amazing help
I actually had the formula
couldn't think of how to write it.
Thanks so much!
Btw, your explanation was awesome
If wanted to do this for 2n+1 people, and 1 person was left out, then I would get:
Is a right answer to 2n people, correct?
Angel_white, I don't think your logic works for the 2n+1 case.
f(n) = (2n+1 -2)*f(n-1) isn't right, also I did -2 cause you have to include he can't pair with the guy you excluded.
It took me a while to see that, but here is why:
Lets use n=2 for our example. We will have two pairs plus one person for 5 people total, lets represent them with circles like this:
Lets choose circle1 to be the lonely person, then we have 4 circles left, which we can use our formula to determine. So if circle1 is lonely, then there will be 3 possibilities because f(2)=3
Now lets choose circle2 to be the lonely circle, there will again be 4 dots with 3 possible matchups.
Now circle3,4, &5 will have the same pattern, so what we realize is that our previously discovered formula will be invoked once for every circle attending our party. Since there are (2n+1) circles, we can simply multiply the previous formula by (2n+1) to arrive at the correct answer. This gives us the new equation:
And because (2n)! * (2n+1) = (2n+1)!
I am relatively confident that this is correct, but not 100% sure.
EDIT: And upon looking back at your post, I realize that this is the same answer you gave. Good job, you found it much easier than I did ^_^
Angel white, if you see my post early, that's what I got too so I would take it as right also. It took me a while to see why, but your post is much better at understanding the even way. Plato's posted helped me see it the odd way. The only reason why I asked for you to confirm is because I thought that you would offer a really good observation.