On minimal asymptotic basis of order \(g - 1\) (Q1629129)

Let \(h \geq 2\) be a fixed integer. A set \(A\) of nonnegative integers is called an asymptotic basis of order \(h\) if every sufficiently large positive integer can be written as a sum of \(h\) terms from \(A\). An asymptotic basis of order \(h\) is minimal if for every element \(a \in A\), the set \(A \setminus \{a\}\) is not an asymptotic basis of order \(h\). In this paper the author proved that the set of all nonempty finite sums of distinct powers of a \(g \geq 3\) integer and all integers of the form \(2\cdot g^{r}\) is an asymptotic basis of order \(g - 1\) and no subset is a minimal asymptotic basis of order \(g - 1\). The proof is based on elementary ideas.