\[ S = \{1, 7, 13, 19, 25, \ldots , 199\}. \]

Find the least value \(n\) such that for any subset \(T \subset S\) with \(n\) elements, we are guaranteed of finding two distinct elements of \(T\) that sum to 206.

×

Problem Loading...

Note Loading...

Set Loading...