A 2003×2004 rectangle consists of unit squares. We consider rhombi formed by four diagonals of unit squares. What maximum number of such rhombi can be arranged in this rectangle so that no two of them have any common points except vertices? Proposed by A. Golovanov
Problem
Source: Tuymaada 2003, day 1, problem 1.
Tags: geometry, rectangle, combinatorics proposed, combinatorics