olymmath

CMO 2009 Problem 1

  • Paper
  • Answer

Given an m×nm \times n grid with squares coloured either black or white, we say that a black square in the grid is stranded if there is some square to its left in the same row that is white and there is some square above it in the same column that is white (see Figure).

FiguRE 1. A 4×54 \times 5 grid with no stranded black squares

Find a closed formula for the number of 2×n2 \times n grids with no stranded black squares.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2 \cdot 3^{n} - 2^{n}

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

Locator ca-cmo/2009/p1 · Tag 3WJR2T79N1 · Edit this page on GitHub · Keys: j next, k previous