# Danny's subsets

Discrete Mathematics Level pending

Let $$A = \left\{ 1,2,3, \ldots 2013 \right\}$$. Find the smallest integer $$n$$ such that any subset $$B \subseteq A$$ with $$\lvert B \rvert \geq n$$ contains at least one pair of distinct numbers whose sum is a multiple of $$61$$.

This problem is posed by Danny H.

×