A sum packing problem of Erdös and the Conway-Guy sequence

DOI10.1090/S0002-9939-96-03653-2zbMath0874.11027OpenAlexW1746761902MaRDI QIDQ3837637

Tom Bohman

Publication date: 10 December 1996

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-96-03653-2

zbMATH Keywords

distinct subset sumsConway-Guy sequencesum packing problem

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Ramsey theory (05D10)

Related Items (6)

Newman polynomials with prescribed vanishing and integer sets with distinct subset sums ⋮ Some remarks on the Erdős Distinct subset sums problem ⋮ Bigger and better subset‐sum‐distinct sets ⋮ Unnamed Item ⋮ Non-injective knapsack public-key cryptosystems ⋮ An extremal problem for subset-sum-distinct sequences with congruence conditions

Cites Work

• A construction for sets of integers with distinct subset sums
• Integer Sets with Distinct Subset-Sums
• Sets of Integers Whose Subsets Have Distinct Sums
• Unnamed Item

This page was built for publication: A sum packing problem of Erdös and the Conway-Guy sequence