Sums in a Subset

Level pending

Let \(S=\{1,2,3,\cdots,2014\}\). Find the maximum number of elements in a subset of \(S\), \(T\), such that the sum of any 213 distinct elements of \(T\) is a multiple of 3.

×

Problem Loading...

Note Loading...

Set Loading...