Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

Irregular sets of integers generated by the greedy algorithm


Author: Joseph L. Gerver
Journal: Math. Comp. 40 (1983), 667-676
MSC: Primary 10L20; Secondary 10H20
MathSciNet review: 689480
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The greedy algorithm was used to generate sets of positive integers containing no subset of the form $ \{ x,x + y,x + 2y\} $, $ \{ x,x + y,x + 3y\} $, $ \{ x,x + 2y,x + 3y\} $, $ \{ x,x + 3y,x + 4y\} $, $ \{ x,x + 3y,x + 5y\} $, and $ \{ x,x + y,x + 2y,x + 3y\} $, respectively. All of these sets have peaks of density in roughly geometric progression.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10L20, 10H20

Retrieve articles in all journals with MSC: 10L20, 10H20


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1983-0689480-2
PII: S 0025-5718(1983)0689480-2
Article copyright: © Copyright 1983 American Mathematical Society