olymmath

HMMT 2011 U18

  • Guts
  • Answer

In how many ways can each square of a 4×20114 \times 2011 grid be colored red, blue, or yellow such that no two squares that are diagonally adjacent are the same color?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

64 \cdot 3^{4020}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2011/u18 · Tag KXBSACJ6X7 · Edit this page on GitHub · Keys: j next, k previous