Greedy algorithm, arithmetic progressions, subset sums and divisibility

DOI10.1016/S0012-365X(98)00385-9zbMath0939.11006WikidataQ105956388 ScholiaQ105956388MaRDI QIDQ1301639

András Sárközy, Vsevolod F. Lev, Csaba Sándor, Paul Erdős, Gerard Rauzy

Publication date: 2 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithm; arithmetic progression; divisibility; subset sums; 3-free set

Mathematics Subject Classification ID

11B25: Arithmetic progressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems on non-averaging and non-dividing sets
• Finite addition theorems. II
• On the lower estimation of non-averaging sets
• Integer sets containing no arithmetic progressions
• Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
• Irregular Sets of Integers Generated by the Greedy Algorithm
• Integer Sets Containing No Arithmetic Progressions
• Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
• Sums of sets of group elements
• On a conjecture of Erdös and Heilbronn
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Primes in short intervals