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

Difference between revisions of "2013 AIME II Problems/Problem 9"

m (changed "then" to "them")
(→‎Solution)
Line 12: Line 12:
 
* Seven pieces: <math>\dbinom{6}{6}=1</math>
 
* Seven pieces: <math>\dbinom{6}{6}=1</math>
  
−
Secondly, we consider how many ways to color them:
+
Secondly, we use Principle of Inclusion-Exclusion to consider how many ways to color them:
  
 
* Three pieces: <math>3^3-3\times 2^3+3=6</math>
 
* Three pieces: <math>3^3-3\times 2^3+3=6</math>

Revision as of 19:34, 16 August 2015

Problem 9

A $7\times 1$ board is completely covered by $m\times 1$ tiles without overlap; each tile may cover any number of consecutive squares, and each tile lies completely on the board. Each tile is either red, blue, or green. Let $N$ be the number of tilings of the $7\times 1$ board in which all three colors are used at least once. For example, a $1\times 1$ red tile followed by a $2\times 1$ green tile, a $1\times 1$ green tile, a $2\times 1$ blue tile, and a $1\times 1$ green tile is a valid tiling. Note that if the $2\times 1$ blue tile is replaced by two $1\times 1$ blue tiles, this results in a different tiling. Find the remainder when $N$ is divided by $1000$.

Solution

Firstly, we consider how many different ways possible to divide the $7\times 1$ board. We ignore the cases of 1 or 2 pieces since we need at least one tile of each color.

  • Three pieces: $5+1+1$, $4+2+1$, $4+1+2$, etc, $\dbinom{6}{2}=15$ ways in total
  • Four pieces: $\dbinom{6}{3}=20$
  • Five pieces: $\dbinom{6}{4}=15$
  • Six pieces: $\dbinom{6}{5}=6$
  • Seven pieces: $\dbinom{6}{6}=1$

Secondly, we use Principle of Inclusion-Exclusion to consider how many ways to color them:

  • Three pieces: $3^3-3\times 2^3+3=6$
  • Four pieces: $3^4-3\times 2^4+3=36$
  • Five pieces: $3^5-3\times 2^5+3=150$
  • Six pieces: $3^6-3\times 2^6+3=540$
  • Seven pieces: $3^7-3\times 2^7+3=1806$

Finally, we combine them together: $15\times 6+20\times 36+15\times 150+6\times 540+1\times 1806= 8106$.

So the answer is $\boxed{106}$.

See Also

2013 AIME II (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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2013_AIME_II_Problems/Problem_9&oldid=71655"