No CrossRef data available.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 03 November 2016
For numbers a ≥ b ≥ l we shall denote by (a, b) the set of numbers b, b + 1, …, a. We shall say that a set S of numbers is perfect if there exists a sequence containing just one pair of each of the numbers in S, satisfying the condition: for every number r in the set, the two r’s are separated by exactly r places, and having no gaps (a perfect sequence).
page 250 of note * The writing of this paper is part of the work made possible by a grant from the Carnegie Corporation of New York for the development of the author’s approach to mathematics.
page 253 of note † These are proved in the paper which follows.
page 253 of note ‡ Th. Skolem. On certain disturbution of integers in pairs with given differences. Math. Scand. 5 (1957), 57-68.