Skip to main content
1 of 2
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459

The sharp bound is ${n\choose \lceil n/2\rceil}$ by Sperner's theorem (the subsets with the same sum are not contained one in another).

Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459