1. The problem statement, all variables and given/known data There are 8 beads: 4 black, 3 white, and 1 red. How many ways can these be arranged on necklace? 2. Relevant equations Just combinations nCm = (n-m)!/(m!). 3. The attempt at a solution 8C4 = 70, 4C3 = 24, and 1C1 = 1, so the total number of combinations is 95? Or do I multiply them, resulting in 1680 possibilities? Multiplication seems like the logical way of solving it, because it is a union of the sets of possibilities, but I haven't done this is a long time so I'm unsure.