No CrossRef data available.
Published online by Cambridge University Press: 26 February 2010
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
