Show that in any set of n integers, n>= 3, there always exists a pair of integers
whose dierence is divisible by n - 1. (Use the pigeonhole principle.)
I can never seem to figure out how to do these pigionhole principle problems. Every one of them seems different to the last one I looked at. Is there some kind of process to it? How would you do the one above?