ON SEQUENCES WITHOUT GEOMETRIC PROGRESSIONS

Authors
BROWN BE GORDON DM
Citation
Be. Brown et Dm. Gordon, ON SEQUENCES WITHOUT GEOMETRIC PROGRESSIONS, Mathematics of computation, 65(216), 1996, pp. 1749-1754
Citations number
8
Categorie Soggetti
Mathematics,Mathematics
Journal title
Mathematics of computation → ACNP
ISSN journal
00255718
Volume
65
Issue
216
Year of publication
1996
Pages
1749 - 1754
Database
ISI
SICI code
0025-5718(1996)65:216<1749:OSWGP>2.0.ZU;2-S
Abstract
Several papers have investigated sequences which have no k-term arithm etic progressions, finding bounds on their density and looking at sequ ences generated by greedy algorithms. Rankin in 1960 suggested looking at sequences without k-term geometric progressions, and constructed s uch sequences for each k with positive density. In this paper we impro ve on Rankin's results, derive upper bounds, and look at sequences gen erated by a greedy algorithm.