Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2000 PMWC Problems/Problem T2

Revision as of 20:30, 21 April 2014 by TheMaskedMagician (talk | contribs) (→‎Problem)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A $5 \times 5 \times 5$ cube is formed using $1 \times 1 \times 1$ cubes. A number of the smaller cubes are removed by punching out the 15 designated columns from front to back, top to bottom, and side to side. Find the number of smaller cubes that remain.

[asy] import three; currentprojection=orthographic(1,1/2,0.4); draw(surface((5,1,1)--(5,1,2)--(5,2,2)--(5,2,1)--cycle),black,nolight); draw(surface((5,1,3)--(5,1,4)--(5,2,4)--(5,2,3)--cycle),black,nolight); draw(surface((5,3,1)--(5,3,2)--(5,4,2)--(5,4,1)--cycle),black,nolight); draw(surface((5,3,3)--(5,3,4)--(5,4,4)--(5,4,3)--cycle),black,nolight); draw(surface((5,2,2)--(5,2,3)--(5,3,3)--(5,3,2)--cycle),black,nolight); draw(surface((1,5,1)--(1,5,2)--(2,5,2)--(2,5,1)--cycle),black,nolight); draw(surface((1,5,3)--(1,5,4)--(2,5,4)--(2,5,3)--cycle),black,nolight); draw(surface((3,5,1)--(3,5,2)--(4,5,2)--(4,5,1)--cycle),black,nolight); draw(surface((3,5,3)--(3,5,4)--(4,5,4)--(4,5,3)--cycle),black,nolight); draw(surface((2,5,2)--(2,5,3)--(3,5,3)--(3,5,2)--cycle),black,nolight); draw(surface((1,1,5)--(1,2,5)--(2,2,5)--(2,1,5)--cycle),black,nolight); draw(surface((1,3,5)--(1,4,5)--(2,4,5)--(2,3,5)--cycle),black,nolight); draw(surface((3,1,5)--(3,2,5)--(4,2,5)--(4,1,5)--cycle),black,nolight); draw(surface((3,3,5)--(3,4,5)--(4,4,5)--(4,3,5)--cycle),black,nolight); draw(surface((2,2,5)--(2,3,5)--(3,3,5)--(3,2,5)--cycle),black,nolight); for(int i = 0; i <= 5; ++i) draw((i,0,5)--(i,5,5)); for(int i = 0; i <= 5; ++i) draw((0,i,5)--(5,i,5)); for(int i = 0; i <= 5; ++i) draw((5,i,0)--(5,i,5)); for(int i = 0; i <= 5; ++i) draw((5,0,i)--(5,5,i)); for(int i = 0; i <= 5; ++i) draw((i,5,0)--(i,5,5)); for(int i = 0; i <= 5; ++i) draw((0,5,i)--(5,5,i)); //Credit to chezbgone2 for the diagram[/asy]

Solution

See Also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2000_PMWC_Problems/Problem_T2&oldid=61702"