Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T01:03:58.390Z Has data issue: false hasContentIssue false

On Non-Averaging Sets of Integers

Published online by Cambridge University Press:  20 November 2018

Leo Moser*
Affiliation:
University of Alberta
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.

Let 5 be a set of positive integers no three of which are in arithmetical progression, i.e., if A, B, C are distinct elements of S, A + B ≠ 2C. We call such a set a non-averaging set. Let v(n) denote the maximum number of elements not exceeding n in any non-averaging set. The problem of finding bounds for v(n) has been treated by several authors [1, 3, 5, 6, 7]. The question first arose in connection with a theorem of van der Waerden [8].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1953