Daily Math Puzzle 2026/11/11

Original Post on X

English

Let \(m,n\) be positive integers such that \(mn\) is a multiple of 3. Place \(1\times2\) dominoes on a rectangular board with \(m\) rows and \(n\) columns, aligned with the grid and without overlap. Dominoes may be placed vertically or horizontally. What is the minimum number of dominoes needed so that no further domino can be placed on the board?

日本語

\(m,n\) を正の整数とし,\(mn\) は3の倍数とする. 縦 \(m\) マス,横 \(n\) マスの長方形の盤面に,\(1\times2\) のドミノを,マス目に沿って重ならないように置く. ドミノは縦向きにも横向きにも置いてよい. これ以上1枚も置けない状態にするには,最少で何枚置けばよいか.

Try it