Exercise 527Combinatorics › Pigeonhole principleL1Added 3 Nov 2026
Difference divisible by $n$
#pigeonhole#difference#divisibility
Statement
Show that among any integers, two have difference divisible by .
Hint
Look at residues modulo .
Show solutionHide solution
Solution
Residues. There are residue classes modulo .
Pigeonhole. With integers and residue classes, two have the same residue.
Conclusion. Their difference is divisible by .