I am studying for my GREs and I came across a Counting Problem in the Manhattan GMAT Word Translations Guide that I am having difficulty solving.
The question is:
Gordon buys 5 dolls for his 5 nieces. The gifts include two identical Sun-and-Fun beach dolls, one Elegant Eddie dress-up doll, one G.I. Josie army doll, and one Tulip Troll doll. If the youngest niece does not want the G.I. Josie doll, in how many different ways can he give the gifts?
My initial approach was to do the # of ways to ignore the rule: 2 x 1 [sun-fun dolls] x 3 x 2 x 1 = 12. Number of ways to break the rule: 2 x 1 [sun-fun dolls] x 2 x 1 x 1 = 4. Subtracting the # of ways to break the rule from # way to ignore the rule = 12 - 4 = 8. This is not correct though.