In this paper, we deal with a simple geometric problem: Is it possible to partition rectangle into k non-congruent rectangles of equal area? This problem is motivated by the so-called ‘Mondrian art problem’ that asks similar question for dissections integer sides. Here, generalize Mondrian allowing real case, show minimum value have ‘perfect partition’ (that is, equal-area rectangles) seven. Mo...
