Mock AIME 1 2010 Problems/Problem 8
Revision as of 13:38, 2 August 2024 by Thepowerful456 (talk | contribs) (see also box, statement of problem)
Problem
In the context of this problem, a is a block, a is a block, and a is a block. If is the number of ways George can place one square, two identical dominoes, and three identical triominoes on a chessboard such that no two overlap, find the remainder when is divided by 1000.
Solution
Once the pieces are placed, there will be blank spaces. So, we are simply ordering triominoes, dominoes, square, and blank spaces. That's just , with last three digits .
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 |