We derive lower and upper bounds on possible growth rates of certain sets of positive integers A k = {1 = a 1 < a 2 < . . . < a k } such that all integers n ∈ {0, 1, 2, . . . , ka k } can be represented as a sum of no more than k elements of A k , with repetition.
We derive lower and upper bounds on possible growth rates of certain sets of positive integers A k = {1 = a 1 < a 2 < . . . < a k } such that all integers n ∈ {0, 1, 2, . . . , ka k } can be represented as a sum of no more than k elements of A k , with repetition.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.