Y by wu2481632, Davi-8191, samrocksnature, HWenslawski, math31415926535, jhu08, Adventure10, Mango247, ItsBesi, cubres, NicoN9
Find, with proof, the least integer
such that if any
elements are removed from the set
, one can still find
distinct numbers among the remaining elements with sum
.





This post has been edited 1 time. Last edited by NormanWho, Apr 20, 2016, 9:31 PM