olymmath

HMMT 2005 S6

  • Team 2

Let kk be an integer such that k∣ak \mid a and k∣bk \mid b. Prove that if an m×nm \times n rectangle is ( a,ba, b )-tileable, then 2k∣m2 k \mid m or 2k∣n2 k \mid n.

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