On an inequality of A. Stöhr concerning the bases of the natural numbers
Let \(2 \leq h \in \mathbb{N}\) then \(B \subseteq \mathbb{N}_ 0\) is called a basis of order \(h\) if every \(n \in \mathbb{N}\) can be expressed as a sum \(b_ 1 + \cdots + b_ n\) with \(b_ j \in B\). Let \(B(n) : = | \{m \in B \mid 1 \leq m \leq n \}|\). The following lower estimate is due to \textit{A. Stöhr} [J. Reine Angew. Math. 194, 40-65 (1955; Zbl 0066.031)]: \[ \limsup_{n \to \infty} B(n) n^{-1/h} \geq (h!)^{1/h} \Gamma^{-1} (1 + 1/h). \tag{*} \] As the author points out, there is a gap in Stöhr's proof. \textit{J. Riddell} was the first who filled this gap in his master's thesis (Univ. of Alberta, 1960, unpublished). Using generating functions, the author gives a shorter new and elegant proof of \((*)\).
This page was built for publication: On an inequality of A. Stöhr concerning the bases of the natural numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319587)
