olymmath

NO-ABEL 1998 Problem 2

    Let be given an n×nn \times n chessboard, n∈Nn \in N . We wish to tile it using particular tetraminos which can be rotated. For which nn is this possible if we use (a) TT -tetraminos (b) both kinds of LL -tetraminos?

    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 no-abel/1998/p2 · Tag MVWDM13A0W · Edit this page on GitHub · Keys: j next, k previous