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 "Mock AIME 1 2010 Problems/Problem 8"

(→‎Previous solution only accounted for order?)
m (see also box, statement of problem)
 
Line 1: Line 1:
 +
== Problem ==
 +
In the context of this problem, a <math>\emph{square}</math> is a <math>1 \times 1</math> block, a <math>\emph{domino}</math> is a <math>1 \times 2</math> block, and a <math>\emph{triomino}</math> is a <math>1 \times 3</math> block. If <math>N</math> is the number of ways George can place one square, two identical dominoes, and three identical triominoes on a <math>1 \times 20</math> chessboard such that no two overlap, find the remainder when <math>N</math> is divided by 1000.
 +
 
==Solution==
 
==Solution==
  
 
Once the pieces are placed, there will be <math>20-3(3)-2(2)-1=6</math> blank spaces. So, we are simply ordering <math>3</math> triominoes, <math>2</math> dominoes, <math>1</math> square, and <math>6</math> blank spaces. That's just <math>\frac{12!}{3!2!6!} = 55440</math>, with last three digits <math>\boxed{440}</math>.
 
Once the pieces are placed, there will be <math>20-3(3)-2(2)-1=6</math> blank spaces. So, we are simply ordering <math>3</math> triominoes, <math>2</math> dominoes, <math>1</math> square, and <math>6</math> blank spaces. That's just <math>\frac{12!}{3!2!6!} = 55440</math>, with last three digits <math>\boxed{440}</math>.
 +
 +
== See Also ==
 +
{{Mock AIME box|year=2010|n=1|num-b=7|num-a=9}}
 +
[[Category:Intermediate Combinatorics Problems]]

Latest revision as of 12:38, 2 August 2024

Problem

In the context of this problem, a $\emph{square}$ is a $1 \times 1$ block, a $\emph{domino}$ is a $1 \times 2$ block, and a $\emph{triomino}$ is a $1 \times 3$ block. If $N$ is the number of ways George can place one square, two identical dominoes, and three identical triominoes on a $1 \times 20$ chessboard such that no two overlap, find the remainder when $N$ is divided by 1000.

Solution

Once the pieces are placed, there will be $20-3(3)-2(2)-1=6$ blank spaces. So, we are simply ordering $3$ triominoes, $2$ dominoes, $1$ square, and $6$ blank spaces. That's just $\frac{12!}{3!2!6!} = 55440$, with last three digits $\boxed{440}$.

See Also

Mock AIME 1 2010 (Problems, Source)
Preceded by
Problem 7 		Followed by
Problem 9
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Mock_AIME_1_2010_Problems/Problem_8&oldid=224237"