I came across this problem in a book called limits, sequences combinations great book for intro to combinatorics .
A rattle consists of a ring with $3$ white beads and $7$ red ones strung on it. Some rattles seemingly different can be made identical by arranging the rings and moving the beads in a suitable manner (rotation or flipping). Find the number of different rattles .
I of course thought polya enumeration on this one but was thinking it can be done case by case without being too messy . Can anyone help? Also this is essentially the same problem as a necklace with $n$ beads, $k$ colors is it not ?
A hand count is not hard. You have to find a way to organize it so you count each configuration only once. We get one configuration for each weak partition of $7$ into $3$ parts. We get $$7,0,0\\6,1,0\\5,2,0\\5,1,1\\4,3,0\\4,2,1\\3,3,1\\3,2,2$$ for eight possibilities. Clearly these are all distinct. You need to convince yourself that there are not two configurations for a partition, but rotation and flipping give six configurations, which matches the number of orders of a partition.