Vol. 7, No. 2, 2014

Download this article
Download this article For screen
For printing
Recent Issues

Volume 11
Issue 5, 721–900
Issue 4, 541–720
Issue 3, 361–540
Issue 2, 181–359
Issue 1, 1–179

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Addresses
Editors’ Interests
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
Author Index
Coming Soon
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
New results on an anti-Waring problem

Chris Fuller, David R. Prier and Karissa A. Vasconi

Vol. 7 (2014), No. 2, 239–244

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 1 r 50 and N(3,r) for 1 r 30.

number theory, Waring, anti-Waring, series
Mathematical Subject Classification 2010
Primary: 11A67
Received: 24 April 2013
Revised: 10 July 2013
Accepted: 24 July 2013
Published: 16 November 2013

Communicated by Nigel Boston
Chris Fuller
Department of Mathematics
Cumberland University
Lebanon, TN 37087
United States
David R. Prier
Department of Mathematics
Gannon University
Erie, PA 16541-0001
United States
Karissa A. Vasconi
1440 Heinz Avenue
Sharon, PA 16146
United States