>Hi!
>
>>I need more details about the problem. For example, what is the size of the square, what is the size of each rectangle?
>
>There is no size defined, it could change for both.
>This solution is for a printer house, they want to find the most efficient
>way to print their posters, flyers, books, etc.
>
>Regards

There is the inverse square law - but it may not help.

Calculus resolves to a point - infinitely small - which means you could populate a given square with an inifinite number of rectangles.

As Hilmar suggested - and recognizing we all live in a macro-geometric world (never heard that phrase myself:), before we can contain anything in a given piece of geometric real-estate, we would need to accept some basic rules:

1) That any prospect for containment cannot have a lenght or width greater than the diminsions of the container.

2) As the prospects are added to the container, the dimensions of the available real-estate constrain the the allowable diminsions of subsequent prospects.

3) With software, hope is offered, because the diminsions of the prospects can be skewed (stretched) to fit the available space.

Here's some urls:
http://www.itl.nist.gov/div898/handbook/eda/section3/eda35f.htm
http://mathforum.org/elempow/solutions/ruth/95.96/solution.jan8.html