Art of Problem Solving
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

2004 AIME II Problems/Problem 3: Difference between revisions

← Older editNewer edit →
m →See also: forgot to adjust #s..
mNo edit summary
Line 1: Line 1:
== Problem ==
== Problem ==
A solid rectangular block is formed by gluing together <math> N </math> congruent 1-cm [[cube]]s face to face. When the block is viewed so that three of its faces are visible, exactly 231 of the 1-cm cubes cannot be seen. Find the smallest possible value of <math> N. </math>
A solid [[rectangular solid | rectangular block]] is formed by gluing together <math> N </math> [[congruent (geometry) | congruent]] 1-cm [[cube (geometry) | cube]]s [[face]] to face. When the block is viewed so that three of its faces are visible, exactly 231 of the 1-cm cubes cannot be seen. Find the smallest possible value of <math> N. </math>


== Solution ==
== Solution ==
231 cubes cannot be visible, so at least one extra layer of cubes must be on top of these. The prime factorization of 231 is <math>3\cdot7\cdot11</math>, and that is the only combination of lengths of sides we have for the smaller block (without the extra layer). The extra layer makes the entire block <math>4\cdot8\cdot12</math>. Multiplying gives us the answer, <math>N=384</math>.
The 231 cubes which are not visible must lie below exactly one layer of cubes.  Thus, they form a rectangular solid which is one unit shorter in each dimension.  If the original block has dimensions <math>l \times m \times n</math>, we must have <math>(l - 1)\times(m-1) \times(n - 1) = 231</math>. The [[prime factorization]] of 231 is <math>3\cdot7\cdot11</math>, so we have a variety of possibilities; for instance, <math>l - 1 = 1</math> and <math>m - 1 = 11</math> and <math>n - 1 = 3 \cdot 7</math>, among others.  However, it should be fairly clear that the way to minimize <math>l\cdot m\cdot n</math> is to make <math>l</math> and <math>m</math> and <math>n</math> as close together as possible, which occurs when the smaller block is <math>3 \times 7 \times 11</math>.  Then the extra layer makes the entire block <math>4\times8\times12</math>, and <math>N=384</math>.


== See also ==
== See also ==
{{AIME box|year=2004|num-b=2|num-a=4|n=II}}
{{AIME box|year=2004|num-b=2|num-a=4|n=II}}

Revision as of 12:29, 14 February 2007

Problem

A solid rectangular block is formed by gluing together $N$ congruent 1-cm cubes face to face. When the block is viewed so that three of its faces are visible, exactly 231 of the 1-cm cubes cannot be seen. Find the smallest possible value of $N.$

Solution

The 231 cubes which are not visible must lie below exactly one layer of cubes. Thus, they form a rectangular solid which is one unit shorter in each dimension. If the original block has dimensions $l \times m \times n$, we must have $(l - 1)\times(m-1) \times(n - 1) = 231$. The prime factorization of 231 is $3\cdot7\cdot11$, so we have a variety of possibilities; for instance, $l - 1 = 1$ and $m - 1 = 11$ and $n - 1 = 3 \cdot 7$, among others. However, it should be fairly clear that the way to minimize $l\cdot m\cdot n$ is to make $l$ and $m$ and $n$ as close together as possible, which occurs when the smaller block is $3 \times 7 \times 11$. Then the extra layer makes the entire block $4\times8\times12$, and $N=384$.

See also

2004 AIME II (Problems • Answer Key • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2004_AIME_II_Problems/Problem_3&oldid=13188"