Suresums

Research output: Contribution to journalArticle

Abstract

A suresum is a pair (A, n), A ⊂ {1, ..., n-1}, so that whenever A is 2-colored some monochromatic set sums to n. A "finite basis" for the suresum (A, n) with |A| ≦c is proven to exist. For c fixed, it is shown that no suresum (A, n) exist if n is a sufficiently large prime. Generalizations to r-colorations, r>2, are discussed.

Original languageEnglish (US)
Pages (from-to)203-208
Number of pages6
JournalCombinatorica
Volume1
Issue number2
DOIs
StatePublished - Jun 1981

Keywords

  • AMS subject classification (1980): 05C15

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Suresums'. Together they form a unique fingerprint.

  • Cite this