Daily Math Puzzle 2026/10/31

Original Post on X

English

Let \(n\) be an integer with \(n\geq2\). We want to break a chocolate bar with \(n\) rows and \(n\) columns into individual squares. In one move, choose one rectangular piece and break it into two rectangles along a single straight grid line. Multiple pieces cannot be broken at the same time. What is the minimum number of moves that produce two pieces with equal numbers of squares?

日本語

\(n\) を2以上の整数とする. 縦横 \(n\) マスの板チョコを,1マスずつにばらばらにしたい. 1回の操作では,長方形のかけらを一つ選び,マス目に沿った1本の直線で二つの長方形に割る. 一度に複数のかけらを割ることはできない. マス数が等しい二つのかけらに割る操作は,最少で何回必要か.

Try it