Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-26T13:21:09.548Z Has data issue: false hasContentIssue false

A Note on Some Perfect Squared Squares

Published online by Cambridge University Press:  20 November 2018

Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In a recent paper [5], general methods were described for the dissection of a square into a finite number n of unequal non-overlapping squares. In this note, examples of such perfect squares are given in which the sides and elements are relatively small integers; in particular, a dissection of a square into 24 different elements, which is believed to be the squaring of least order known at the present time.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1951

References

[1] Stone, A. H., Amer. Math. Monthly, vol. 47 (1940), 570572.Google Scholar
[2] Brooks, R. L., Smith, C. A. B., Stone, A. H., Tutte, W. T., The dissection of rectangles into squares, Duke Math. J., vol. 7 (1940), 312340.Google Scholar
[3] Bouwkamp, C. J., On the dissection of rectangles into squares (Papers I, II, and III), Neder. Akad. Wetensch. Proa, vol. 49 (1946), 1176-1188 and vol. 50 (1947), 5878.Google Scholar
[4] Willcocks, T. H., Fairy Chess Review, vol. 7, Aug./Oct. 1948.Google Scholar
[5] Tutte, W. T., Squaring the square, Can. J. Math., vol. 2 (1950), 197209.Google Scholar