Mock AIME 6 2006-2007 Problems/Problem 11

Revision as of 10:25, 23 November 2023 by Tomasdiaz (talk | contribs) (Created page with "==Problem== Each face of an octahedron is randomly colored blue or red. A caterpillar is on a vertex of the octahedron and wants to get to the opposite vertex by traversing t...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Each face of an octahedron is randomly colored blue or red. A caterpillar is on a vertex of the octahedron and wants to get to the opposite vertex by traversing the edges. The probability that it can do so without traveling along an edge that is shared by two faces of the same color is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.