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 limsupk∞ n(2,k)/k2 ≤ 0.4789.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.