On Thin Sets of Primes Expressible as Sumsets

Simple item page
dc.creatorCroot, Ernie
dc.creatorElsholtz, Christian
dc.date2002-09-11
dc.date.accessioned2026-07-07T04:50:47Z
dc.date.available2026-07-07T04:50:47Z
dc.descriptionSuppose 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.
dc.identifierhttps://arxiv.org/abs/math/0209137
dc.identifierhttp://arxiv.org/abs/math/0209137
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64920
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11P32
dc.titleOn Thin Sets of Primes Expressible as Sumsets
dc.typetext

Files

Collections

arXiv