Prove that there must exist an integer m such that any collection of m integers will either contain a pair whose sum is divisible by 10, or contain a pair whose difference is divisible by 10. Once you have accomplished this, compute the smallest such integer m. (use the pigeonhole principle)
