Abstract
My first encounter with Paul Erdős was curiously indirect. As a pre-undergraduate at Cambridge (England) in 1934, I learned from one of the Trinity College tutors that a mathematician named Erdős, passing through Cambridge, had mentioned an intriguing conjecture (attributed to Lusin, I believe), implying that a square could not be dissected into a finite number of unequal smaller square pieces. I passed this problem on to three fellow students, and we eventually found methods that produced counterexamples [1]. Of recent years the advent of high-speed computing has given rise to a considerable industry listing large numbers of dissections of squares into unequal squares ([2] and [6] for example), an industry that could continue indefinitely as there are infinitely many different dissections of this kind.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
P. Erdős remarks: autumn 1939
- 2.
P. Erdős remarks: 1943
References
R. L. Brooks, C. A. B. Smith, A. H. Stone and W. T. Tutte, The dissection of rectangles into squares, Duke Math. J. 7 (1940) 312–340.
C. J. Bouwkamp and A. J. W. Duijvestijn, Catalogue of Simple Perfect Squared Squares of orders 21 through 25, Eindhoven University of Technology 1992.
P. Erdős and A. H. Stone, Some remarks on almost periodic transformations, Bull. Amer. Math. Soc. 51 (1945) 126–130.
P. Erdős and A. H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946) 1087–1091.
P. Erdős and A. H. Stone, On the sum of two Borel sets, Proc. Amer. Math. Soc. 25 (1970) 304–306.
Jasper Dale Skinner II, Squared Squares: Who’s Who and What’s What, Lincoln, Nebraska, 1993.
C. Engelman, On close-packed double-error-correcting codes on p symbols, 1. R. E. Transactions on Information Theory, Correspondence, January 1961, 51–52.
V. A. Lebesgue, Sur l’impossibilité en nombres entiers de l’équation \({x}^{m} = {y}^{2} + 1\), Nouv. Ann. Math. 9 (1850), 178–181.
L. J. Mordell, Diophantine Equations, Academic Press 1969, esp. p. 301.
I. Niven and H. S. Zuckerman, Introduction to the Theory of Numbers, Wiley, New York 1960.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stone, A.H. (2013). Encounters with Paul Erdős. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7258-2_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7257-5
Online ISBN: 978-1-4614-7258-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)