A set of non-negative integers is called a 2-basis for an integer N if every integer between 0 and N (inclusive) can be expressed as a sum of exactly 2 elements of the set. Let K(N) denote the cardinality of the smallest such 2- basis for N. We seek a lower bound for K(N).
In a very pretty 1960 Acta Arithmetica paper, Leo Moser established such a bound. This talk will recap his method, and a combinatorial lemma will be introduced that allows for a slight sharpening of the result.
Thomas Struppeck