It all adds up to 11.

Number Theory Level pending

Find the least \(k\) such that any \(k\)-element subset of \(\left\{ 1,2,...,10 \right\} \) contains numbers whose sum is divisible by 11.

×

Problem Loading...

Note Loading...

Set Loading...