No CrossRef data available.
Article contents
Arithmetic progressions in finite sets of real numbers
Published online by Cambridge University Press: 18 May 2009
Extract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 1973