There are $n$ (distinct) pairs of gloves. In how many ways can $n$ people select a left handed and right handed glove, such that they do not select a pair? Please give me an expression in terms of $n$.

This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.

When posting on Brilliant:

Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .

Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.

Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.

Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

Markdown

Appears as

*italics* or _italics_

italics

**bold** or __bold__

bold

- bulleted - list

bulleted

list

1. numbered 2. list

numbered

list

Note: you must add a full line of space before and after lists for them to show up correctly

There are $n!$ ways for the people to first select a left-hand glove. Selecting a right hand glove is then equivalent to finding the number of derangements.

@Leonardo Cidrão
–
No, that doesn't make sense. There aren't exactly $n!$ ways for the people to select gloves such that at least one of them has a pair. Like Daniel commented, there are $n!$ ways to select the left-hand gloves, and the number of ways to select the right-hand gloves is the number of derangements of $n$ elements, which is denoted by $!n$. It turns out, if you take $\frac{n!}{e}$ (where $e$ is Euler's number) and round it to the nearest integer, then you get $!n$, for all positive integers $n$.

Your question is incomplete. You are not mentioning whether each person takes equal no(2) of gloves or anyone can select any no. of gloves.
If there is no constraint on the no. of gloves a person can choose , then ans. is $\binom{n}{2}^2$

I see that each person selects "a left-handed and a right-handed glove", indicating at least one of each? And by the condition that there are only $n$ pairs of gloves and $n$ people, it's pretty obvious that each person must select one of each. Of course, if the question was edited after you posted your comment then I can't tell.

Besides, even with your interpretation, for $n=2$ it's wrong; there are $2$ ways (a person chooses one left glove and the right glove that doesn't make a pair and the other person takes the rest; there are two such pairs) while your formula gives $1$.

Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in`\(`

...`\)`

or`\[`

...`\]`

to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestThere are $n!$ ways for the people to first select a left-hand glove. Selecting a right hand glove is then equivalent to finding the number of derangements.

Log in to reply

But I think it's n! for lefthands and n! for the rights, in total of (n!)^2, isn' it?

Log in to reply

Except each person must have a left hand glove and a right hand glove that aren't a pair.

Log in to reply

Log in to reply

$n!$ ways for the people to select gloves such that at least one of them has a pair. Like Daniel commented, there are $n!$ ways to select the left-hand gloves, and the number of ways to select the right-hand gloves is the number of derangements of $n$ elements, which is denoted by $!n$. It turns out, if you take $\frac{n!}{e}$ (where $e$ is Euler's number) and round it to the nearest integer, then you get $!n$, for all positive integers $n$.

No, that doesn't make sense. There aren't exactlyLog in to reply

Log in to reply

Log in to reply

Your question is incomplete. You are not mentioning whether each person takes equal no(2) of gloves or anyone can select any no. of gloves. If there is no constraint on the no. of gloves a person can choose , then ans. is $\binom{n}{2}^2$

Log in to reply

I see that each person selects "a left-handed and a right-handed glove", indicating at least one of each? And by the condition that there are only $n$ pairs of gloves and $n$ people, it's pretty obvious that each person must select one of each. Of course, if the question was edited after you posted your comment then I can't tell.

Besides, even with your interpretation, for $n=2$ it's wrong; there are $2$ ways (a person chooses one left glove and the right glove that doesn't make a pair and the other person takes the rest; there are two such pairs) while your formula gives $1$.

Log in to reply