|
|||||
|
|
Greedy algorithm, arithmetic progressions, subset sums and divisibility |
|
| Authors: | P Erd s V Lev G Rauzy C Sndor A Srkzy |
| Institution: | a Mathematical Institute of the Hungarian Academy of Sciences, H-1053 Budapest, Reáltanoda U. 13-15, Hungary b Department of Mathematics, University of Georgia, Athens, GA 30602, USA c Institute de Mathématiques de Luminy, UPR 9016 CNRS, 163 Avenue de Luminy, Case 930 F-13288, Marseille Cédex 09, France d Department of Algebra and Number Theory, Eötvös Loránd University, H-1088 Budapest, Múzeum krt. 6-8, Hungary |
| Abstract: | We consider a number of density problems for integer sequences with certain divisibility properties and sequences free of arithmetic progressions. Sequences of the latter type that are generated by a computer using modifications of the greedy algorithm are also provided. |
| Keywords: | Greedy algorithm Arithmetic progressions Subset sums Divisibility |
| 本文献已被 ScienceDirect 等数据库收录！ | |