On Thin Sets of Primes Expressible as Sumsets

Details On Thin Sets of Primes Expressible as Sumsets On Thin Sets of Primes Expressible as Sumsets

2002-09-11

arxiv.org/abs/math/0209137v1

Mathematics

Number Theory

Scientific paper

Suppose that P is an infinite set of primes such that P = A + B + C, where
A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x
(where P(x) = the number of elements of P that are <= x), and if A,B,C is a
"regular" triple of sets, then either |A+B| <= d, or |B+C| <= d, or |A+C| <= d.

Affiliated with

Also associated with

No associations

Rating

On Thin Sets of Primes Expressible as Sumsets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Thin Sets of Primes Expressible as Sumsets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Thin Sets of Primes Expressible as Sumsets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-592964