Difference between revisions of "2005 AIME I Problems/Problem 9"
Bluelinfish (talk | contribs) m (→Solution) |
m (→Solution 2) |
||
Line 28: | Line 28: | ||
---- | ---- | ||
− | As | + | As a side note, notice that the placement of the two unpainted faces is in fact of vital importance: if they were on opposite faces, the answer would be 0 because any placement of such a cube in the corner of the large cube would show one unpainted face. |
== See also == | == See also == | ||
{{AIME box|year=2005|n=I|num-b=8|num-a=10}} | {{AIME box|year=2005|n=I|num-b=8|num-a=10}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 12:43, 21 January 2019
Problem
Twenty seven unit cubes are painted orange on a set of four faces so that two non-painted faces share an edge. The 27 cubes are randomly arranged to form a cube. Given the probability of the entire surface area of the larger cube is orange is where and are distinct primes and and are positive integers, find
Contents
[hide]Solution
We can consider the orientation of each of the individual cubes independently.
Solution 1
The unit cube at the center of our large cube has no exterior faces, so all of its orientations work.
For the six unit cubes and the centers of the faces of the large cube, we need that they show an orange face. This happens in of all orientations, so from these cubes we gain a factor of .
The twelve unit cubes along the edges of the large cube have two faces showing, and these two faces are joined along an edge. Thus, we need to know the number of such pairs that are both painted orange. We have a pair for each edge, and 7 edges border one of the unpainted faces while only 5 border two painted faces. Thus, the probability that two orange faces show for one of these cubes is , so from all of these cubes we gain a factor of .
Finally, we need to orient the eight corner cubes. Each such cube has 3 faces showing, and these three faces share a common vertex. Thus, we need to know the number of vertices for which all three adjacent faces are painted orange. There are six vertices which are a vertex of one of the unpainted faces and two vertices which have our desired property, so each corner cube contributes a probability of and all the corner cubes together contribute a probability of
Since these probabilities are independent, the overall probability is just their product, and so the answer is .
Solution 2
Rather than worry about the actual painted faces, consider the position of the shared edge of the non-colored faces. The six centers of the faces can be calculated in the same manner as last time, getting .
The twelve edge cubes show two faces. We want the shared edge of the non-colored faces to not be one of the edges that are exposed on the outside. There are 7 such edges that can be seen when viewed from the outside, so the probability they cannot be seen are .
The eight corner cubes each have 9 visible edges from the outside, so the probability that the edge of the non-colored faces is not one of those is . Multiplying the probabilities together, we get the same exact solution.
As a side note, notice that the placement of the two unpainted faces is in fact of vital importance: if they were on opposite faces, the answer would be 0 because any placement of such a cube in the corner of the large cube would show one unpainted face.
See also
2005 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.