Difference between revisions of "2005 AIME I Problems/Problem 5"
m |
|||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| + | * [[2005 AIME I Problems/Problem 4 | Previous problem]] | ||
| + | * [[2005 AIME I Problems/Problem 6 | Next problem]] | ||
* [[2005 AIME I Problems]] | * [[2005 AIME I Problems]] | ||
| + | |||
| + | [[Category:Intermediate Combinatorics Problems]] | ||
Revision as of 16:58, 17 January 2007
Problem
Robert has 4 indistinguishable gold coins and 4 indistinguishable silver coins. Each coin has an engraving of one face on one side, but not on the other. He wants to stack the eight coins on a table into a single stack so that no two adjacent coins are face to face. Find the number of possible distunguishable arrangements of the 8 coins.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
