Compact symmetric solutions to the postage stamp problem
Thomas, Hugh · van Willigenburg, Stephanie
Original · EN
We derive lower and upper bounds on possible growth rates of certain sets of positive integers Aₖ={1= a₁ < a₂ <... < aₖ} such that all integers n∈ {0, 1, 2,..., kaₖ} can be represented as a sum of no more than k elements of Aₖ, with repetition.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.