A (2n−1)×(2n+1) board is to be divided into rectangles with sides parallel to the sides of the board and integer side lengths such that the area of each rectangle is a power of 2. Find the minimum number of rectangles that the board may be divided into. geometryrectangleinductioncombinatorics proposedcombinatorics