olymmath

HMMT 2011 U30

  • Guts
  • Answer

How many ways are there to color the vertices of a 2n2 n-gon with three colors such that no vertex has the same color as its either of its two neighbors or the vertex directly across from it?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

3^{n}+(-2)^{n+1}-1

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/u30 · Tag AAEFQTESR8 · Edit this page on GitHub · Keys: j next, k previous