olymmath

OMCC 2000 Problem 2

  • Day 1

Determine all positive integers nn such that it is possible to tile a 15×n15 \times n board with pieces shaped like this:

Dataset text AI-MO AoPS. Quoted with source.

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 centro/2000/p2 · Tag 4YNKDEQ27N · Edit this page on GitHub · Keys: j next, k previous