An extremal problem for subset-sum-distinct sequences with congruence conditions

DOI10.1016/S0012-365X(97)00221-5zbMath0951.11010WikidataQ126812431 ScholiaQ126812431MaRDI QIDQ1584356

Jaegug Bae

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmsubset-sum-distinct sequence

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Related Items (1)

Classification of greedy subset-sum-distinct-sequences.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved lower bound on the greatest element of a sum-distinct set of fixed order
• Integer Sets with Distinct Subset-Sums
• A sum packing problem of Erdös and the Conway-Guy sequence
• Shorter Notes: Distinct Sums over Subsets
• On Weird and Pseudoperfect Numbers
• Sets of Integers Whose Subsets Have Distinct Sums

This page was built for publication: An extremal problem for subset-sum-distinct sequences with congruence conditions