Arithmetic progressions in finite sets of real numbers
Glasgow mathematical journal, Tome 14 (1973) no. 2, pp. 101-104
Voir la notice de l'article provenant de la source Cambridge University Press
In this paper we investigate the structure of a set of n reals that contains a maximal number of l-term arithmetic progressions. This problem has been indicated by J. Riddell. Let l and n be positive integers with 2 ≦ l ≦ n. By F1(n) we denote the maximal number of l-term arithmetic progressions that a set of n reals can contain. A set of n reals containing F1(n)l-progressions will be called an Fl,(n)-set.
Klotz, W. Arithmetic progressions in finite sets of real numbers. Glasgow mathematical journal, Tome 14 (1973) no. 2, pp. 101-104. doi: 10.1017/S0017089500001828
@article{10_1017_S0017089500001828,
author = {Klotz, W.},
title = {Arithmetic progressions in finite sets of real numbers},
journal = {Glasgow mathematical journal},
pages = {101--104},
year = {1973},
volume = {14},
number = {2},
doi = {10.1017/S0017089500001828},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500001828/}
}
[1] 1.Riddell, J., On sets of numbers containing no l terms in arithmetic progression, Nieuw Arch. Wisk. (3) 17 (1969), 204–209. Google Scholar
Cité par Sources :