Year: 1985
Type: article
Abstract: Let A be a sequence of positive integers. Define P(A) to be the set of all integers representable as a sum of distinct terms of A. Note that if A contains a repeated value, we are free to use it as many times as it occurs in A. We call A complete if every sufficiently large positive integer is in P(A), and entirely complete if every positive integer is in P(A). Completeness properties have received considerable, if somewhat sporadic, attention over the years. See Chapter 6 of [3] for a survey.
Source: Glasgow Mathematical Journal
Authors: S. A. Burr, P. Erdös
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2043381187
