PigeonholePrinciple AMC10/12
2002


Problem - 2373
What is the smallest integer n for which any subset of {1, 2, 3, . . . , 20} of size $n$ must contain two numbers that differ by 8?

report an error