Proof Writing · Medium problem

What is the smallest number of integers you must choose to be SURE that two of them leave the same remainder when divided by $3$?