6

Part of 1999 CentroAmerican

Problems(1)

Source: CentroAmerican & Caribbean MO 1999 Q6

S

as the subset of

\{1,2,3,\dots,1000\}

with the property that none of the sums of two different elements in

S

S

. Find the maximum number of elements in

S

floor functioninductioncombinatorics proposedcombinatorics