MathDB
max |S|

Source: CentroAmerican & Caribbean MO 1999 Q6

January 24, 2007
floor functioninductioncombinatorics proposedcombinatorics

Problem Statement

Denote SS as the subset of {1,2,3,…,1000}\{1,2,3,\dots,1000\} with the property that none of the sums of two different elements in SS is in SS. Find the maximum number of elements in SS.
Back to ProblemsView on AoPS