On a problem of Erdos, Nathanson and Sarkozy
On a problem of Erdos, Nathanson and Sarkozy
复制标题
关于鄂尔多斯、内桑森和萨科齐的问题
DOI:
10.1016/j.jnt.2019.02.025
复制
发表时间:
2019
影响因子:
0.7
通讯作者:
Li Ya-Li
中科院分区:
文献类型:
--
作者:
Chen Yong-Gao;Li Ya-Li
Abstract Text In 1988, Erdős, Nathanson and Sárközy proved that, if A is a set of nonnegative integers with the lower asymptotic density 1/k, where k is a positive integer, then (k+ 1) A must contain an infinite arithmetic progression with difference at most k 2− k, where (k+ 1) A is the set of all sums of k+ 1 elements of A, and asked if (k+ 1) A must contain an infinite arithmetic progression with difference at most O (k). In this paper, we solve this problem by proving that, for every sufficiently large integer k, there exists a set A of nonnegative integers with the lower asymptotic density 1/k such that (k+ 1) A does not contain an infinite arithmetic progression with difference less than k 1.5. We also study the similar problem when A has the lower asymptotic density 0< w< 1. Video For a video summary of this paper, please visit https://youtu. be/B1QJc2IFSIw.