Abstract
The classic theorem of Lagrange states that every nonnegative integer n is the sum of four squares. How “sparse” can a set of squares be and still retain the four square property. For any set X of nonnegative integers set Nx(x) = |{i ∈ X, ≤x}|. Let S = {0,1,4,9,…} denote the squares. If \(X \subseteq S\) and every n ≥ 0 can be expressed as the sum of four elements of X then how slow can be the growth rate of Nx(x) ? Clearly we must have = N(x1/4). Our object here is to give a quick proof of the following result of Wirsing[3]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
REFERENCES
Ravi Boppana, Joel Spencer, A Useful Elementary Correlation Inequality, J. Combinatorial Th.(Ser. A) 50 (1989), 305–307
Emil Grosswald, Representations of Integers as Sums of Squares, Springer- Verlag (New York), 1985
Eduard Wirsing, Thin Subbases, Analysis 6 (1986), 285–30
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Spencer, J. (1996). Four Squares with Few Squares. In: Chudnovsky, D.V., Chudnovsky, G.V., Nathanson, M.B. (eds) Number Theory: New York Seminar 1991–1995. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2418-1_22
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2418-1_22
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94826-3
Online ISBN: 978-1-4612-2418-1
eBook Packages: Springer Book Archive