Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Greedy sums of distinct squares
HTML articles powered by AMS MathViewer

by Hugh L. Montgomery and Ulrike M. A. Vorhauer PDF
Math. Comp. 73 (2004), 493-513 Request permission

Abstract:

When a positive integer is expressed as a sum of squares, with each successive summand as large as possible, the summands decrease rapidly in size until the very end, where one may find two $4$’s, or several $1$’s. We find that the set of integers for which the summands are distinct does not have a natural density but that the counting function oscillates in a predictable way.
References
Similar Articles
Additional Information
  • Hugh L. Montgomery
  • Affiliation: Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109-1109
  • MR Author ID: 126550
  • Email: hlm@umich.edu
  • Ulrike M. A. Vorhauer
  • Affiliation: Department of Mathematics, Kent State University, Kent, Ohio 44242
  • Email: vorhauer@math.kent.edu
  • Received by editor(s): May 18, 2001
  • Published electronically: June 19, 2003
  • Additional Notes: The first author was supported in part by NSF Grant DMS 0070720
  • © Copyright 2003 American Mathematical Society
  • Journal: Math. Comp. 73 (2004), 493-513
  • MSC (2000): Primary 11B83, 11A63, 11Y70, 34J10
  • DOI: https://doi.org/10.1090/S0025-5718-03-01513-8
  • MathSciNet review: 2034134