Representing an integer as the sum of a prime and the product of two small factors
Abstract
Let c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x1/2 and ab is less than nc. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce the idea of 'intersecting two sieves' as a tool in the proof of this result.
0