Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-13T10:34:53.341Z Has data issue: false hasContentIssue false

Sieving with sums

Published online by Cambridge University Press:  16 November 2021

Jack M. Robertson
Affiliation:
Washington State University
William A. Webb
Affiliation:
Washington State University

Extract

A number of deep theorems and unsolved problems ask questions about the relationship of the additive and multiplicative structure of the natural numbers. The famous four squares theorem of Lagrange says that if we form all possible sums of four squares we get the entire sequence of nonnegative integers. Goldbach’s conjecture states that if all possible sums of two odd primes are formed we get every even integer greater than 4.

The depth and difficulty of such problems stand in surprising contrast to the similar question: “Which numbers are not generated when all possible sums of two or more consecutive natural numbers are formed?” The answer is all powers of 2 and the proof is accessible to anyone who can sum arithmetic sequences. This result is an excellent discovery exercise for students, particularly appropriate for teacher training courses.

Type
Research Article
Copyright
Copyright © The Mathematical Association 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Guy, R., Sums of consecutive integers, The Fibonacci Quarterly 20, No. 1 (1982): 3638.Google Scholar
2. La Rosa, B. de, Primes, powers, and partitions, The Fibonacci Quarterly 16, No. 6 (1978) : 518–22.Google Scholar
3. Leveque, W.J., On representation as a sum of consecutive integers, Canad. J. Math. 4 (1950): 399405.10.4153/CJM-1950-036-3CrossRefGoogle Scholar