2000 AMC 10 Problems/Problem 13

Revision as of 17:49, 7 January 2009 by BOGTRO (talk | contribs) (New page: The question is rather ambiguous, however I will assume that the pegs of the same color are distinguishable. Clearly, there is only 1 possible ordering if the colors are indistinguishable...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The question is rather ambiguous, however I will assume that the pegs of the same color are distinguishable.

Clearly, there is only 1 possible ordering if the colors are indistinguishable.

Thus, $5! \cdot 4! \cdot 3! \cdot 2! \cdot 1!$

Or, C.

Invalid username
Login to AoPS