2006 AIME I Problems/Problem 11: Difference between revisions
mNo edit summary |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
A collection of 8 | A collection of 8 [[cube (geometry) | cube]]s consists of one cube with edge-length <math> k </math> for each [[integer]] <math> k, 1 \le k \le 8. </math> A tower is to be built using all 8 cubes according to the rules: | ||
* Any cube may be the bottom cube in the tower. | * Any cube may be the bottom cube in the tower. | ||
| Line 6: | Line 6: | ||
Let <math> T </math> be the number of different towers than can be constructed. What is the remainder when <math> T </math> is divided by 1000? | Let <math> T </math> be the number of different towers than can be constructed. What is the remainder when <math> T </math> is divided by 1000? | ||
== Solution == | == Solution == | ||
{{solution}} | |||
== See also == | == See also == | ||
* [[2006 AIME I Problems/Problem 10 | Previous problem]] | |||
* [[2006 AIME I Problems/Problem 12 | Next problem]] | |||
* [[2006 AIME I Problems]] | * [[2006 AIME I Problems]] | ||
[[Category:Intermediate Combinatorics Problems]] | |||
Revision as of 11:21, 30 October 2006
Problem
A collection of 8 cubes consists of one cube with edge-length 
for each integer 
A tower is to be built using all 8 cubes according to the rules:
- Any cube may be the bottom cube in the tower.
- The cube immediately on top of a cube with edge-length
must have edge-length at most 
Let 
be the number of different towers than can be constructed. What is the remainder when is divided by 1000?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
