Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-28T00:33:05.628Z Has data issue: false hasContentIssue false
  • English
  • Français

Arithmetic progressions in finite sets of real numbers

Published online by Cambridge University Press:  18 May 2009

W. Klotz
W. Klotz
Affiliation:
Institut Für Mathematik, Technische Universität, 3392 Clausthal, Germany
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Glasgow Mathematical Journal , Volume 14 , Issue 2 , September 1973 , pp. 101 - 104
Copyright
Copyright © Glasgow Mathematical Journal Trust 1973

References

REFERENCE

1.Riddell, J., On sets of numbers containing no l terms in arithmetic progression, Nieuw Arch. Wisk. (3) 17 (1969), 204–209.Google Scholar