Difference between revisions of "1987 AJHSME Problems/Problem 7"
Virjoy2001 (talk | contribs) m (→Solution) |
m (→Solution 2) |
||
| Line 31: | Line 31: | ||
There are <math>10</math> painted unit squares on the half of the cube shown, so there are <math>10\cdot 2=20</math> unit cubes with at least one face painted, thus our answer is <math>\boxed{\text{C}}</math>. | There are <math>10</math> painted unit squares on the half of the cube shown, so there are <math>10\cdot 2=20</math> unit cubes with at least one face painted, thus our answer is <math>\boxed{\text{C}}</math>. | ||
| + | |||
| + | |||
| + | ==Solution 2== | ||
| + | |||
| + | Since it says at least one, we can count the number of unpainted cubes, and subtract from 27. There is 1 inner cube, 2 center cubes (see the face with 4 blacks) and 4 edge cubes (see the top two in the center top face), so 7 unpainted. Thus <math>27 - 7 = 7</math> our answer is <math>\boxed{\text{C}}</math>. | ||
| + | |||
| + | ~Shadow-18 | ||
==See Also== | ==See Also== | ||
Revision as of 21:29, 29 November 2020
Contents
Problem
The large cube shown is made up of 
identical sized smaller cubes. For each face of the large cube, the opposite face is shaded the same way. The total number of smaller cubes that must have at least one face shaded is
![[asy] unitsize(36); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((3,0)--(5.2,1.4)--(5.2,4.4)--(3,3)); draw((0,3)--(2.2,4.4)--(5.2,4.4)); fill((0,0)--(0,1)--(1,1)--(1,0)--cycle,black); fill((0,2)--(0,3)--(1,3)--(1,2)--cycle,black); fill((1,1)--(1,2)--(2,2)--(2,1)--cycle,black); fill((2,0)--(3,0)--(3,1)--(2,1)--cycle,black); fill((2,2)--(3,2)--(3,3)--(2,3)--cycle,black); draw((1,3)--(3.2,4.4)); draw((2,3)--(4.2,4.4)); draw((.733333333,3.4666666666)--(3.73333333333,3.466666666666)); draw((1.466666666,3.9333333333)--(4.466666666,3.9333333333)); fill((1.73333333,3.46666666666)--(2.7333333333,3.46666666666)--(3.46666666666,3.93333333333)--(2.46666666666,3.93333333333)--cycle,black); fill((3,1)--(3.733333333333,1.466666666666)--(3.73333333333,2.46666666666)--(3,2)--cycle,black); fill((3.73333333333,.466666666666)--(4.466666666666,.93333333333)--(4.46666666666,1.93333333333)--(3.733333333333,1.46666666666)--cycle,black); fill((3.73333333333,2.466666666666)--(4.466666666666,2.93333333333)--(4.46666666666,3.93333333333)--(3.733333333333,3.46666666666)--cycle,black); fill((4.466666666666,1.9333333333333)--(5.2,2.4)--(5.2,3.4)--(4.4666666666666,2.9333333333333)--cycle,black); [/asy]](http://latex.artofproblemsolving.com/3/2/d/32d182fcce5019c425fe5750bc4ed740d6bbc707.png)
Solution
Clearly, no unit cube has more than one face painted, so the number of unit cubes with at least one face painted is equal to the number of painted unit squares.
There are 
painted unit squares on the half of the cube shown, so there are 
unit cubes with at least one face painted, thus our answer is 
.
Solution 2
Since it says at least one, we can count the number of unpainted cubes, and subtract from 27. There is 1 inner cube, 2 center cubes (see the face with 4 blacks) and 4 edge cubes (see the top two in the center top face), so 7 unpainted. Thus 
our answer is .
~Shadow-18
See Also
| 1987 AJHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 6 |
Followed by Problem 8 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
