MathCastle
Counting & ProbabilityChallengeAdvanced Number Theory

Advanced Number Theory · Challenge problem

Let NN be the number of ways to tile a 3×123 \times 12 board completely with 1×21 \times 2 dominoes (each placed horizontally or vertically). Find the remainder when NN is divided by 10001000.