Hostname: page-component-89b8bd64d-shngb Total loading time: 0 Render date: 2026-05-07T01:56:10.536Z Has data issue: false hasContentIssue false

The inverse Goldbach problem

Published online by Cambridge University Press:  26 February 2010

Christian Elsholtz
Affiliation:
Institut fur Mathematik, TU Clausthal, Erzstrasse 1, D-38678 Clausthal-Zellerfeld, Germany. E-mail: elsholtz@math.tu-clausthal.de.
Get access

Abstract

Improved upper and lower bounds of the counting functions of the conceivable additive decomposition sets of the set of primes are established. Suppose that where, ℝ′ differs from the set of primes in finitely many elements only and .

It is shown that the counting functions A(x) of ℐ and B(x) of ℬ for sufficiently large x, satisfy

Information

Type
Research Article
Copyright
Copyright © University College London 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable