Disjoint pairs with distinct sums

G.J. Woeginger

doi:10.2307/27642907

Disjoint pairs with distinct sums

G.J. Woeginger

Combinatorial Optimization 1

Research output: Contribution to journal › Article › Professional

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 language	English
Pages (from-to)	66-66
Number of pages	1
Journal	Mathematics Magazine
Volume	79
Issue number	1
DOIs	https://doi.org/10.2307/27642907
Publication status	Published - 2006

Access to Document

10.2307/27642907

Cite this

@article{a50358ed2d0644739b7e817488b8f892,

title = "Disjoint pairs with distinct sums",

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.",

author = "G.J. Woeginger",

year = "2006",

doi = "10.2307/27642907",

language = "English",

volume = "79",

pages = "66--66",

journal = "Mathematics Magazine",

issn = "0025-570X",

publisher = "Mathematical Association of America",

number = "1",

}

TY - JOUR

T1 - Disjoint pairs with distinct sums

AU - Woeginger, G.J.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.2307/27642907

DO - 10.2307/27642907

M3 - Article

VL - 79

SP - 66

EP - 66

JO - Mathematics Magazine

JF - Mathematics Magazine

SN - 0025-570X

IS - 1

ER -

Disjoint pairs with distinct sums

Abstract

Access to Document

Fingerprint

Cite this