Solving 15 Boys x 15 Girls Dance Pairs

[TrusighteR]

Homework Statement

Problem: How many ways are there for 15 boys and 15 girls at a dance to pair up into 15 heterosexual dance couples?

Homework Equations

This is probably somewhat helpful, but I couldn't figure out exactly how to implement it.

nCr = $$\frac{n!}{k!(n-k)}$$

The Attempt at a Solution

What I thought was if let's say you have all of the boys in a row 1 to 15, and you just rearrange the girls in every possible combination 15! and just match them up with each boy. then I multiply that number by 15 for the boys, and I get a number of like 19615115520000 which seems quite high...
I also tried to do it using a smaller amount of numbers to get an easier idea of how to do it, but it didn't help me much because then the number seemed too small.

 

[mysterycoder]

In this problem, there are two events, choosing a boy to dance(E$$_{1}$$) and choosing a girl to dance(E$$_{2}$$).
The number of combinations can be given by: E = E$$_{1}$$ $$\ast$$ E$$_{2}$$.
E$$_{1}$$ can be written as $$_{15}$$C$$_{1}$$. This is the number of combinations of 1 person out of a group of 15.
E$$_{2}$$ is the same: $$_{15}$$C$$_{1}$$.
Using the equation you provided, $$_{15}$$C$$_{1}$$ = $$\frac{15!}{1!(15-1)}$$ = 15

Therefore: E = E$$_{1}$$ $$\ast$$ E$$_{2}$$ = $$_{15}$$C$$_{1}$$ $$\ast$$ $$_{15}$$C$$_{1}$$ = 15 * 15 = 225
So, there are 225 combinations.

 

[mysterycoder]

Actually, the equation should be:

nCr = $$\frac{n!}{r!\ast(n-r)!}$$ = $$\frac{15!}{1!\ast(15-1)!}$$

 

[Gib Z]

I'm not sure if that's correct guys, but Welcome to PF both of you.

Your idea was a good one - try the same problem with 2 girls and 2 boys. The first girl has 2 options. Then the second girl only has 1 option. So multiply it- 2 combinations.

3 girls and 3 boys - The first girl can choose between 3 boys. When she chooses, the second girl only has 2 to choose from. Then the last one only has 1 to choose from. So that's 3! combinations.

Extend this to 15 girls and 15 boys.

 

[HallsofIvy]

The way I would do this problem is this:

First put the boys in a line- you can do that any way you like- their order does not matter.

Now choose a girl to dance with the first boy. How many choices do you have?
Once you have done that, choose a girl to dance with the second boy. How many choices do you have for that?
Go through the line of boys like that, and, finally, using the "fundamental principal of counting", multiply the number of choices each time. The answer should be easy- and you should see immediately how that fits Gibz's suggestion.

 

[mysterycoder]

Sorry for giving the incorrect information.