Mathematics – Number Theory
Scientific paper
2010-12-29
Discrete Mathematics 311 (2011) pp. 560-562
Mathematics
Number Theory
Published in Discrete Mathematics
Scientific paper
10.1016/j.disc.2010.12.019
Given a finite set of nonnegative integers A with no 3-term arithmetic progressions, the Stanley sequence generated by A, denoted S(A), is the infinite set created by beginning with A and then greedily including strictly larger integers which do not introduce a 3-term arithmetic progressions in S(A). Erdos et al. asked whether the counting function, S(A,x), of a Stanley sequence S(A) satisfies S(A,x)>x^{1/2-\epsilon} for every \epsilon>0 and x>x_0(\epsilon,A). In this paper we answer this question in the affirmative; in fact, we prove the slightly stronger result that S(A,x)\geq (\sqrt{2}-\epsilon)\sqrt{x} for x\geq x_0(\epsilon,A).
No associations
LandOfFree
On the Growth of the Counting Function of Stanley Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Growth of the Counting Function of Stanley Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Growth of the Counting Function of Stanley Sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-400181