Translator Disclaimer
2014 New results on an anti-Waring problem
Chris Fuller, David Prier, Karissa Vasconi
Involve 7(2): 239-244 (2014). DOI: 10.2140/involve.2014.7.239

Abstract

The number N(k,r) is defined to be the first integer such that it and every subsequent integer can be written as the sum of the k-th powers of r or more distinct positive integers. For example, it is known that N(2,1)=129, and thus the last number that cannot be written as the sum of one or more distinct squares is 128. We give a proof of a theorem that states if certain conditions are met, a number can be verified to be N(k,r). We then use that theorem to find N(2,r) for 1r50 and N(3,r) for 1r30.

Citation

Download Citation

Chris Fuller. David Prier. Karissa Vasconi. "New results on an anti-Waring problem." Involve 7 (2) 239 - 244, 2014. https://doi.org/10.2140/involve.2014.7.239

Information

Received: 24 April 2013; Revised: 10 July 2013; Accepted: 24 July 2013; Published: 2014
First available in Project Euclid: 20 December 2017

zbMATH: 1291.11021
MathSciNet: MR3133722
Digital Object Identifier: 10.2140/involve.2014.7.239

Subjects:
Primary: 11A67

Rights: Copyright © 2014 Mathematical Sciences Publishers

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.7 • No. 2 • 2014
MSP
Back to Top