olymmath

HMMT 2005 T2

  • Team 1

Suppose 0<a≤b0<a \leq b and 4∤mn4 \nmid m n. Prove that the number of ways in which an m×nm \times n rectangle can be partitioned into dominoes of type ( a,ba, b ) is even.

Dataset text NuminaMath olympiads. 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 hmmt/2005/t2 · Tag N5GJPYQ3V9 · Edit this page on GitHub · Keys: j next, k previous