All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
No Incest, Please (Posted on 2005-07-18) Difficulty: 3 of 5
There are three families each with two sons and two daughters. In how many ways can these young people be married so that each couple includes one member of each gender, no couple is brother and sister, and there are no singles left over?

No Solution Yet Submitted by Erik O.    
Rating: 3.6000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution A little more thought | Comment 6 of 13 |

Now that I've demonstrated the danger of off-the-cuff answers...

Take 3 families A, B, C

All in the family option:

BB CC AA or CC AA BB configurations

Within each of the 3 pairs there are 2 options for ordering for 2^3 options for each configuration - total 16 possibilities

Mixed option:

BC AC AB configuration only option

Within each of the three pairs there are 2 options for order of which son marries the daughter of which family for 2^3 options

Additionally, each daughter pair can be "swapped" for 2^3 additional options within each prior option - total 8*8 = 64 possibilities

So I get a total of 80 possibilities.

  Posted by Bob Smith on 2005-07-18 18:34:45
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information