Counting sumsets and sum-free sets modulo a prime

BJ Green, IZ Ruzsa

Research output: Contribution to journalArticle (Academic Journal)peer-review

27 Citations (Scopus)


Let p be a prime. A set A of residues modulo p is said to be sum-free if there axe no solutions to a = a' + a" with a, a', a" is an element of A. We show that there axe 2(p/3+o(p)) such sets. We also count the number of distinct sets of the form B + B, where B is a set of residues modulo p. Once again, there are 2(p/3+o(p)) such sets.
Translated title of the contributionCounting sumsets and sum-free sets modulo a prime
Original languageEnglish
Pages (from-to)285 - 293
JournalStudia Scientiarum Mathematicarum Hungarica
Volume41 (3)
Publication statusPublished - 2004

Bibliographical note

Publisher: Akademiai Kiado
Other identifier: IDS Number: 850HM


Dive into the research topics of 'Counting sumsets and sum-free sets modulo a prime'. Together they form a unique fingerprint.

Cite this