Disjoint pairs with distinct sums

Research output: Contribution to journalArticleProfessional

1 Downloads (Pure)

Abstract

Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integers with the distinct sums less or equal to k. The paper shows that this bound is tight.
Original languageEnglish
Pages (from-to)66-66
Number of pages1
JournalMathematics Magazine
Volume79
Issue number1
DOIs
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'Disjoint pairs with distinct sums'. Together they form a unique fingerprint.

  • Cite this