Abstract
Wright [1934] stated, and probably misnamed, the following variation of the well-known Waring problem concerning writing integers as sums of kth powers. The problem is to find the least n such that for all m there are natural numbers [α 1,…,αn] with
for some choice of signs. We denote the least such n by v(k). Recall that the usual Waring problem requires all positive signs. For arbitrary k the best known bounds for v(k) derive from the bounds for the usual Waring problem. This gives the bound v(k) ≪ klog(k) (though it is believed that the “right” bound in both the usual Waring problem and the easier Waring problem is 0(k)). So to date, the “easier” Waring problem is not easier than the Waring problem. However, the best bounds for small k are derived in an elementary manner from solutions to the Prouhet-Tarry-Escott problem. This is discussed later in this chapter.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Selected References
W.H.J. Fuchs and E.M. Wright, The ‘easier’ Waring problem, Quart. J. Math. Oxford Ser. 10 (1939), 190–209.
L.K. Hua, Introduction to Number Theory, Springer-Verlag, New York-Berlin, 1982.
R.C. Vaughan and T.D. Wooley, Further improvements in Waring’s problem, Acta Math. 174 (1995), 147–240.
E.M. Wright, An easier Waring’s problem, J. London Math. Soc. 9 (1934), 267–272.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Borwein, P. (2002). The Easier Waring Problem. In: Computational Excursions in Analysis and Number Theory. CMS Books in Mathematics / Ouvrages de mathématiques de la SMC. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21652-2_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-21652-2_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3000-2
Online ISBN: 978-0-387-21652-2
eBook Packages: Springer Book Archive