Could you help me at the following exercise?

With how many ways can we choose a man and a woman that are not married to each other from n married couples?

I thought that it is (n-1)

^{n},but I am not sure.Can you tell me if it is right?

**Moderators:** gmalivuk, Moderators General, Prelates

Hello!!!

Could you help me at the following exercise?

With how many ways can we choose a man and a woman that are not married to each other from n married couples?

I thought that it is (n-1)^{n} ,but I am not sure.Can you tell me if it is right?

Could you help me at the following exercise?

With how many ways can we choose a man and a woman that are not married to each other from n married couples?

I thought that it is (n-1)

Can you explain how you got to (n-1)^{n}? Or was it simply a hunch?

Since #(choose unmarried man and woman) = #(choose man and woman) - #(choose married man and woman), I'd approach it from the right-hand side:**Spoiler:**

On a sidenote: must all couples consist of a man and a woman?

[edit] As gmalivuk pointed out I assumed all ways to pair up everyone instead of the ways to choose one couple.

**Spoiler:**

Since #(choose unmarried man and woman) = #(choose man and woman) - #(choose married man and woman), I'd approach it from the right-hand side:

On a sidenote: must all couples consist of a man and a woman?

[edit] As gmalivuk pointed out I assumed all ways to pair up everyone instead of the ways to choose one couple.

Last edited by Flumble on Fri Apr 25, 2014 7:14 pm UTC, edited 3 times in total.

- gmalivuk
- GNU Terry Pratchett
**Posts:**26726**Joined:**Wed Feb 28, 2007 6:02 pm UTC**Location:**Here and There-
**Contact:**

You seem to be counting the total possible ways to pair up all the men with all the women (excluding cases where a man is paired with his wife). The OP seems to be asking for a count of individual man+woman pairs.

Though you're right that it is complicated by the fact that they haven't told us how many of the couples are gay.

Though you're right that it is complicated by the fact that they haven't told us how many of the couples are gay.

evinda wrote:Hello!!!

Could you help me at the following exercise?

With how many ways can we choose a man and a woman that are not married to each other from n married couples?

I thought that it is (n-1)^{n},but I am not sure.Can you tell me if it is right?

So firstly, how many ways are there of choosing a man and a woman? How many of those choices lead to a married couple? Subtract one from the other.

So is the question intended to be basically equivalent to the following?

You have n pegs and n holes, each peg fits into only one of the holes. How many ways can you place the pegs next to the holes so that no peg is next to a hole it fits into?

You have n pegs and n holes, each peg fits into only one of the holes. How many ways can you place the pegs next to the holes so that no peg is next to a hole it fits into?

Summum ius, summa iniuria.

No, I don't think that's equivalent. I think the OP is asking how many ways we can pick one peg and one hole such that the peg does not fit into the hole.

My answer:

**Spoiler:**

My answer:

Xenomortis wrote:O(n^{2}) takes on new meaning when trying to find pairs of socks in the morning.

Not enough information. How many gay married couples exist out of the total? Are all of the people either men or women, or are there some who are neither or both? How many of the people are polygamous?

Assuming entirely heterosexual monogamous couples:

**Spoiler:**

Assuming heterosexual and homosexual monogamous couples:

**Spoiler:**

I'm going to stop here before creating a tangled labyrinth of variables.

Assuming entirely heterosexual monogamous couples:

Assuming heterosexual and homosexual monogamous couples:

I'm going to stop here before creating a tangled labyrinth of variables.

If it looks like a duck, and quacks like a duck, we have at least to consider the possibility that we have a small aquatic bird of the family Anatidae on our hands. –Douglas Adams

If we're looking for ways to pair up men and women from a set of heterosexual monogamous couples such that no-one ends up with their spouse, then we're asking for the number of derangements of the set of women (or equivalently men). As for the number of ways to choose a man and then choose a woman who is not his wife, then it is n*(n-1).

pollywog wrote:I want to learn this smile, perfect it, and then go around smiling at lesbians and freaking them out.Wikihow wrote:* Smile a lot! Give a gay girl a knowing "Hey, I'm a lesbian too!" smile.

Users browsing this forum: No registered users and 7 guests