The Mondrian problem consists of dissecting a square side length n∈N into non-congruent rectangles with natural sides such that the difference d(n) between largest and smallest areas partitioning is minimum. In this paper, we compute some bounds on in terms number partition. These provide us optimal partitions for values n∈N. We sequence d(n)∕n2 tends to zero n large enough. For case ‘perfect’ ...