Question 82
There are $2m$ beads of $m$ distinct colors, two of each color. These beads are distributed into $m$ boxes, two in each box, in such a way that it is possible to choose one bead from each box and obtain a set of $m$ beads of distinct colors. Prove that the number of ways of making this kind of choice is necessarily a power of 2.