IBM Ponder This #062 · June 2003

This month's puzzle was proposed by Harry Nelson and sent in by John G. Fletcher.

Partition a unit square into N > 1 mutually non-congruent rectangles, all of the same area 1/N. For what values of N is this possible?

Clarification: A complete solution will give an implicit list of all the values of N for which it is possible, a clear way of constructing such a partition, and a numerical example for least such value of N.

Solution

Best opened after a real attempt

To be added.