Step-by-step explanation: It's hard and I might not be right, think through it and if you get what I got then submit it, I don't want the blood of failure in my hands >:D gl homie
Let be a set of integers. By the division algorithm the possible remainders when we divide by are . Then, each integer can be written as:
Observe that the set of remainders has elements and each element has possible values. By the Pigenhole principle at least two remainders have the same value. Suppose that this two elements are . Then,