De Econometrist neemt een statistische kijk op de wereld.
Squaring the square is a method of creating an integer square out of other smaller integer squares. Well what even is an integer square? Integer squares are squares whose sides have integer lengths. One example of a normal squared square is a 4×4 square created out of four 2×2 squares. That wasn’t too difficult right? But let us now add the following restriction; the sizes of the smaller squares need to be different. Can you come up with the solution of that particular squaring the square problem? And what if we add another restriction; no subsets of the smaller squares are allowed to form a rectangle. It doesn’t make the squaring the square problem easier right? However, it makes it a lot more interesting!
The squaring the square problem, which includes the two restrictions written above, is called the “perfect simple squaring the square problem”. The first restriction makes the problem “perfect”, the second one makes the problem “simple”. The simple squaring the square problem was studied for the first time by three mathematics students and one chemistry student; R. L. Brooks, C. A. B. Smith, A. H. Stone and W. T. Tutte at Cambridge University between 1936 and 1938. The only thing that was done before by other mathematicians was finding two rectangles made out squares of different sizes. One was made out of ten squares, the other one out of nine squares (see figure below).
The students started solving the squaring the square problem by finding more rectangles made out of squares since finding these rectangles seemed to be much easier than finding squared squares. They first tried to find new squared rectangles by just trial and error. This strategy moderately worked out, but still, finding squared squares was impossible. Therefore, they had to come up with another strategy, a more systemic one. They converted the previously discovered squared rectangles into networks. They converted the squared rectangles into networks in the following way;
– They extended the horizontal lines of the squared rectangles.
– They connected these extended horizontal lines by an arrow if the squares were touching.
– They added the lengths of the squares to the corresponding arrows.
An example of the converting process is given below:
The four students immediately recognized something all these squared rectangle networks had in common; they all had the characteristics of an electrical network! Fortunately, there was numerous amounts of research done in the past about electrical networks. Therefore, the students could easily borrow the theorems of electrical networks and apply these theorems to solve the squaring the square problem. One of these main theorems is called Kirchhof’s law. Kirchhof’s law consists of two compelling parts. The first part is that the total flow into a point has to equal the total flow out of that same point in an electrical network. If we look at the circuit above for example, we see that the left middle point has a total inflow of 36 + 2 = 38 and a total outflow of 5 + 33 = 38. The second interesting part of Kirchhof’s law is that if an electrical network consists of one or more smaller circuits, each particular smaller circuit’s flow has to add up to 0. Note that the above example consists of four smaller circuits. If we look at the upper one, the one consisting of four points, we find 36 – 2 – 9 – 25 = 0. This theorem also works for the other three smaller circuits. Using these electrical network theorems, the four students found squaring squares consisting of 55, 38 and 26 squares. They were pleased with their results, but still not completely satisfied, since they couldn’t figure out what the smallest possible squaring square (smallest in the number of squares) was. This question was left unanswered for thirty-eight more years until the 1970s, when A. J. W. Duijvestijn used a computer to find the smallest possible simple perfect squared square. This squared square, size 112×112, was made out of twenty-one smaller squares (see figure below).
Right now you might be thinking, “Finally, they were done solving this annoying squaring the square problem”. But, you are wrong…there is still a very mysterious problem left open. Just look at the formula below:
In other words, there should be a squared square of size 70×70 consisting of the smaller squares with sizes 1×1, 2×2, 3×3, … , 24×24. Unfortunately, it looks like this squared square cannot be created geometrically. Can you create it?
Dit artikel is geschreven door Mark Woelders