arXiv · math/0503241
A new upper bound for finite additive bases
Abstract
Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this paper it is proved that limsup_{k\to\infty} n(2,k)/k^2 \leq 0.4789.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sinan Gunturk, Melvyn B. Nathanson. 2005-03-13. A new upper bound for finite additive bases. https://arxiv.org/abs/math/0503241
Cite the original work for its findings. Save a collection to share your selection of sources.