The Games and Puzzles Journal — Issue 35, September-October 2004

Back to: GPJ Index Page

Squaring the Square

A note on the dissection of a square into smaller squares all different except for a single pair of equal non-touching squares (or two such pairs)

by T. H. Willcocks (28 May 2004)

Editor's Note: This article has been delayed in publication mainly because I was hoping to find a better way of presenting the dissection diagrams. Mr Willcocks provided A4-size diagrams prepared for him by Dr J. D. Skinner, but it was not possible to reproduce them adequately on the screen. However, George Bell (19 December 2004) has now been able to provide a scale drawing gif-image of the first dissection (A1) as shown above. The impossibility of showing an accurate diagram is evident from the fact that the square side is 6732 units and the screen width is only 800 pixels. So the above image, which is 600 pixels wide, compresses 11.22 units to a pixel. So squares smaller than this, as occur in B1, B3, C1, C2 below, would be lost. For the diagrams in the text I have used the conventional method of showing the squares as rectangles.


During the past 75 years much work has been done on the problem of dividing a rectangle into smaller squares all of different sizes. When the rectangle itself is a square the problem is known as Squaring the Square and a comprehensive theory was developed by four mathematicians at Cambridge by which they showed a relationship between the elements of dissections and the currents in certain electrical networks. Details may be found in [1] and [2]. A very interesting non-mathematical but authoritative account may be found in [3]. The following notes are based entirely on the electrical theory.

In the diagram of Fig.(1a) ABC represents a network where for simplicity interior wiring has been omitted. DEF represents the map which is the dual of an equivalent map to ABC (interior wiring again omitted). These two networks are joined by the wires BE, BD, DC, CF, and FA. If now a current enters the network at A and leaves at E, the theory tells us that (1) the network gives rise to a squared square and (2) the wires BD and CF carry zero currents.

Lying in my bath one evening with a mental picture of such a network, I realised that the wire XD could equally well be drawn as XB and similarly the wire YB could be drawn as YD. What I had done was to replace two sides of the quadrilateral BYDX with the other two sides. It seemed that the natural thing to do was to replace the diagonal BD with the other diagonal XY and see what resulted. I had no reason to expect any interesting outcome, but on evaluating the new network I discovered that (1) I had a squared square, (2) the currents in BX and DY were numerically equal, and (3) vectors could be assigned as shown in Fig.(1b). Knowledge of (2) and (3) can simplify the calculation of currents in the network.

Experiment showed that a similar procedure could be followed with the wire CF or with both wires with a view to obtaining a single pair of equal squares in two different ways or two pairs of equal squares in one way. I have constructed a considerable number of such squares without finding a failure, but I lack a strict proof justifying the procedure. As with all other methods of this kind it is important to check that there is no ‘unwanted’ imperfection.

An example of three squares constructed in this way showing an interesting arithmetical relationship is given in the accompanying diagrams C1, C2, C3. The sum of the duplicated squares in C1 and C2 (92 + 208) is equal to the sum of the two duplicated pairs in C3 (97 + 203).

This method is not restricted to the use of self-dual maps. A dissection of a rectangle in two different ways but with a corner square in one equal to a corner square in the other will yield two different tripolar networks and one of these can be used with the dual of the other.

In this way we can form four networks, and it is their close relationships with each other which result in some curious arithmetical equalities, such as that noted above. From A and B we have 431 + 187 = 332 + 286.

The writer does not claim that all initial networks give such interesting results. He has been content to show some that he has found.


Diagrams of the results. The duplicated squares are highlighted in yellow, and the square connecting them in green.

A1: 34 squares, side 6732 units.
300618701856
6511205
1136734
97554
831
1456865685513623
3741385
1941011
403110
927
454231
591274
634
317411
1102286
227094
2176

A2: 34 squares, side 6876 units.
263723051934
7141220
3321422551
18341135
208506
759
4611265
416804
481609332
699436
28388
360
263654
52683
4332457
2405391
2014

A3: 35 squares, side 9447 units.
356131302756
10021754
4311821878
24761516
250752
1128
6261880
682708431
960556
5001254
177254
10077
404834
831
808
3410430
773057
2980

B1: 34 squares, side 6705 units.
259216812432
911770
2022230
141446183
12851307747305
385
629122
507
560187
1323
126322
939950
1872043
30262611
6151856
1565
1241

B2: 34 squares, side 6732 units.
243222932007
2861721
8421737
1870562
421141
374669
32794
233235
3021419
560
558286
2721102751
2430830
51634166
1585
1600483
1117

B3: 35 squares, side 4669 units.
180415261339
1871152
6041109
1490314
30212
298318
2948
28620
151187
1441008
11536
774702
695
1375115
72468162
1260396
1170
864

C1: 34 squares, side 6705 units.
281721491739
4101329
6681048843
1555777485288380
20556276
1405
19692
1368357
1195
292194
389
919
778291
680
2333
922232
2140

C2: 34 squares, side 6876 units.
263717622477
875887
7061771
1175644818513362
353534
3593
356
305208
1751065
470174
1098
2961001
61705
1236
2082628
5922420
1828

C3: 35 squares, side 9413 units.
350933062598
7081890
203115315061152
24041308
35476830
358380212203
1920
53150
16844
97
1693414
1096570
548
1182
1118
3508
973005
2908


It is possible to make further speculations. It is obvious that the process is reversible. The method employed results in all cases with a square containing 3 component squares situated as in Fig.(2a). Reversing the process the two squares A are removed and a zero current is introduced.
Fig.2a
AB
A
Fig.2b
ABA
D
A

What happens if we remove by this process in a square with a configuration as in Fig.(2b) the two squares A which adjoin square D? The small number of examples I have tested have all yielded squared squares.

The sceptical reader might care to test the inverse method with the following square, Fig.(3). At first sight this does not look like a candidate but it can be made one by treating the square [4] as being 4 squares of side 2 surrounding a zero square. To my surprise I found that this resulted in a square (imperfect of side 313). Is it conceivable that a perfect square could be found in this way?

Fig.(3). 21 squares, side 107
343637
322
2117
1621
4209
916
417
13
41
342
32

In conclusion I would like to express my thanks to Dr J. D. Skinner for his help with the diagrams.


References.
[1] The dissection of rectangles into squares R. L. Brooks, C. A. B. Smith, A. H. Stone, W. T. Tutte, (Duke Math J. Vol.7 p.312-340)
[2] Squaring the Square W. T. Tutte (Can. J. Math. Vol.2 p.197-209, 1950).
[3] Squaring the Square W. T. Tutte (Chapter 17 of the 2nd Scientific American Book of Mathematical Puzzles and Diversions).


George Bell cites the following website on squaring the square, though I've not been able to access it properly since its "javascript" does not pass my computer's security settings. www.squaring.net
Update (2 June 2013): My more recent computers have had no trouble with access to the site. I have corresponded with the author Stuart Anderson. There is now a page devoted to T. H. Willcocks and his work: THW on www.squaring.net. Mr Willcocks reached the age of 100 on 19 April 2012.


Copyright © 2004 — G. P. Jelliss and contributing authors.
Partial results may be quoted provided proper acknowledgement of the source is given.
Back to: GPJ Index Page