Greedy sums of distinct squares |
| |
| Authors: | Hugh L. Montgomery Ulrike M. A. Vorhauer. |
| |
| Affiliation: | Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109-1109 ; Department of Mathematics, Kent State University, Kent, Ohio 44242 |
| |
| 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  's, or several  '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. |
| |
| Keywords: | Greedy algorithm differential-difference equations |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
|
点击此处可从《Mathematics of Computation》下载全文 |
