An effective additive basis for the integers (Q1901053)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An effective additive basis for the integers |
scientific article |
Statements
An effective additive basis for the integers (English)
0 references
3 June 1996
0 references
\textit{P. Erdös} [Acta Sci. Math. 15, 255-259 (1954; Zbl 0057.03901)] proved by probabilistic means the existence of a set \(E\) of integers such that the number \(r(n)\) of representations of \(n\) as a sum of two elements of \(E\) satisfies \(c \log n < r(n) < C \log n\). Here an effective construction of such a set is given. The decision to include or exclude \(n\) depends on certain conditional probabilities, whose definition is motivated by Erdös' proof. The procedure produces the elements of \(E\) one by one and the time requires to find all elements up to \(n\) is polynomial in \(n\).
0 references
effective additive basis
0 references