![](/files/happy5.png)
subset sum
Sets with distinct subset sums ★★★
Author(s): Erdos
Say that a set has distinct subset sums if distinct subsets of
have distinct sums.
Conjecture There exists a fixed constant
so that
whenever
has distinct subset sums.
![$ c $](/files/tex/dccee841f3f498c2c58fa6ae1c1403c5a88c5b8d.png)
![$ |S| \le \log_2(n) + c $](/files/tex/493a86991ee82d34f35bf457f417ec42892b4c5f.png)
![$ S \subseteq \{1,2,\ldots,n\} $](/files/tex/c6a976583643131f2542c200da7e75610cb3772d.png)
Keywords: subset sum
![Syndicate content Syndicate content](/misc/feed.png)