Browse · MathNet
PrintAustria 2010
Austria 2010 counting and probability
Problem
Two dissections of a square into three rectangles are considered essentially different if one cannot be switched to the other by simple rearrangement of the pieces. How many essentially different dissections of the square into three rectangles with integer side lengths exist such that the area of one rectangle is equal to the arithmetic mean of the areas of the other two? G. Baron, Vienna
Solution
There are two distinct possibilities for dissections that we must consider. The rectangles can either be in the form of three "strips" (i.e. all with one side of length ) or there can be one such strip, with the other two rectangles resulting from a cut at right angles to the first cut.
We first consider the case of the three strips. Since the areas of the strips are all equal to times their width, they must be such that the middle one has a width that is the arithmetic mean of the widths of the other two. Since , the width of the middle strip is certainly , and the width of the smallest strip can be any integer less than or equal to . There are therefore possible dissections in this case.
We now consider the other option. Naming the areas of the three strips , and with and , we again have two possible cases. The rectangle with area can either be the strip or one of the other rectangles.
Let us assume that the strip has area . Since its area is one third of the area of the square, this rectangle has the dimensions . The other two together therefore have the dimensions , and the common edge must be of length . Since the shorter edge of the rectangle with area can be any integer from to , and there are therefore possible dissections in this case.
Finally, we assume that the strip, which has the dimensions , either has area or . There must then exist an integer , so that we can write . Since and , both and must be divisible by , and we can write and . Substituting, we therefore obtain with . Since also holds, we also have . must therefore be a divisor of between and , which yields possible values , , and for . This yields possible values of , , and for , which in turns yields possible values of , , and for . The value was already counted in the previous case, however, since this is the case for which holds. We therefore have possible dissections that have not already been counted.
In total, we obtain possible dissections which the required properties.
We first consider the case of the three strips. Since the areas of the strips are all equal to times their width, they must be such that the middle one has a width that is the arithmetic mean of the widths of the other two. Since , the width of the middle strip is certainly , and the width of the smallest strip can be any integer less than or equal to . There are therefore possible dissections in this case.
We now consider the other option. Naming the areas of the three strips , and with and , we again have two possible cases. The rectangle with area can either be the strip or one of the other rectangles.
Let us assume that the strip has area . Since its area is one third of the area of the square, this rectangle has the dimensions . The other two together therefore have the dimensions , and the common edge must be of length . Since the shorter edge of the rectangle with area can be any integer from to , and there are therefore possible dissections in this case.
Finally, we assume that the strip, which has the dimensions , either has area or . There must then exist an integer , so that we can write . Since and , both and must be divisible by , and we can write and . Substituting, we therefore obtain with . Since also holds, we also have . must therefore be a divisor of between and , which yields possible values , , and for . This yields possible values of , , and for , which in turns yields possible values of , , and for . The value was already counted in the previous case, however, since this is the case for which holds. We therefore have possible dissections that have not already been counted.
In total, we obtain possible dissections which the required properties.
Final answer
1678
Techniques
Enumeration with symmetryFactorization techniquesIntegers