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)

 

On $ k$-free sequences of integers


Author: Samuel S. Wagstaff
Journal: Math. Comp. 26 (1972), 767-771
MSC: Primary 10-04; Secondary 10L99
MathSciNet review: 0325500
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $ {A^{(k)}}(n)$ denote the cardinality of the largest subsequence of $ 0,1,2, \cdots ,n - 1$, which contains no $ k$ numbers in arithmetical progression. (Such a sequence is called $ k$-free.) $ {A^{(k)}}(n)$ is computed (on an IBM 360/65) for $ 3 \leqq k \leqq 8$, and various values of $ n$ to about 50. The results support the old conjecture that for all $ k$, the limit $ {\tau ^{(k)}} = {\lim _{n \to \infty }}({A^{(k)}}(n))/n = 0$. The results $ {\tau ^{(5)}} < .649,{\tau ^{(6)}} < .721,{\tau ^{(7)}} < .776$, and $ {\tau ^{(8)}} < .8071$ are obtained. Several cases of a (disproved) conjecture of G. Szekeres are verified, including $ {A^{(5)}}(94) = 64$.


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


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10-04, 10L99

Retrieve articles in all journals with MSC: 10-04, 10L99


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1972-0325500-5
PII: S 0025-5718(1972)0325500-5
Keywords: $ k$-free sequences, arithmetic progressions in sequences
Article copyright: © Copyright 1972 American Mathematical Society