Einige Bemerkungen zum Goldbach'schen Problem

Abstract

Abstract. Some Remarks on Goldbach's Problem. By combinatorial means the authors show the existence of "thin" sub-sets of primes, useful for Goldbach decompositions. For example, there is a set P' of primes

Erdős and the Integers

“…Recently Dufner and Wolke (1994) applied these ideas to the construction of a thin set P$ of primes, having < <(log x) 2 elements up to x, such that all but O(x(log x) &C ) even integers up to x are of the form p+ p$, with both p, p$ primes and p$ # P$. Wolke (1996) found that by allowing more, but still o(x), exceptions, P$ can be made even thinner.…”