You are here:

Advanced Math/Probability discrete math

Advertisement


Question
How do you solve this question? i got the answer for it on the link but i'm not sure how you get there.
http://img690.imageshack.us/img690/7463/answerlb.png

two people of the same sex could sit side-by-side.
If in addition to the condition that no husband and wife are
side-by-side we require that no two people of the same sex are
side-by-side, we obtain a famous problem known as the menage
problem. Solve this problem.

Answer
I don't find that address.

I will assume we have n couples.
The number of ways to seat the men is n!.
The number of ways to seat the 1st woman is n-2.
One or two couples could not be done.

Lets take 3 couples.  There would be 2 ways to seat the men, since they have to sit every other chair and could be seated clockwise or counterclockwise.  Once they have been sat down, there is only 1 way to sit the women, so the total ways is 2.

If there are 4 couples, the men give 3! = 6 combinations for the men.
Given where they are, there are only two ways to put in the girls, so 2*6=12 total ways.

If there are 5 couples, the men have 4! = 24 ways to sit.
For each of these, I find 12 ways to sit the women, and 12 = 2*3!.


If there are n couples, the men have (n-1)! ways to sit.
For each of these, I find 2(n-2)! ways for the women to sit.
This gives a total of 2(n-1)!(n-2)!

Advanced Math

All Answers


Answers by Expert:


Ask Experts

Volunteer


Scott A Wilson

Expertise

I can answer any question in general math, arithetic, discret math, algebra, box problems, geometry, filling a tank with water, trigonometry, pre-calculus, linear algebra, complex mathematics, probability, statistics, and most of anything else that relates to math. I can even tell you it takes me over 2,000 steps to go a mile, but is that relevant?

Experience

Experience in the area; I have tutored people in the above areas of mathematics for almost two years in AllExperts.com. I have tutored people here and there in mathematics since before I received a BS degree almost 25 years ago. In just two more years, I received an MS degree as well, but more on that later. I tutored at OSU in the math center for all six years I was there. Most students offering assistance were juniors, seniors, or graduate students. I was allowed to tutor as a freshman. I tutored at Mathnasium for well over a year. I worked at The Boeing Company for over 5 years. I received an MS degreee in Mathematics from Oregon State Univeristy. The classes I took were over 100 hours of upper division credits in mathematical courses such as calculus, statistics, probabilty, linear algrebra, powers, linear regression, matrices, and more. I graduated with honors in both my BS and MS degrees. Past/Present Clients: College Students at Oregon State University, various math people since college, over 7,500 people on the PC from the US and rest the world.

Publications
My master's paper was published in the OSU journal. The subject of it was Numerical Analysis used in shock waves and rarefaction fans. It dealt with discontinuities that arose over time. They were solved using the Leap Frog method. That method was used and improvements of it were shown. The improvements were by Enquist-Osher, Godunov, and Lax-Wendroff.

Education/Credentials
Master of Science at OSU with high honors in mathematics. Bachelor of Science at OSU with high honors in mathematical sciences. This degree involved mathematics, statistics, and computer science. I also took sophmore level physics and chemistry while I was attending college. On the side I took raquetball, but that's still not relevant.

Awards and Honors
I earned high honors in both my BS degree and MS degree from Oregon State. I was in near the top in most of my classes. In several classes in mathematics, I was first. In a class of over 100 students, I was always one of the first ones to complete the test. I graduated with well over 50 credits in upper division mathematics.

Past/Present Clients
My clients have been students at OSU, people nearby, friends with math questions, and several people every day on the PC, and you're probably make one more.

©2012 About.com, a part of The New York Times Company. All rights reserved.