Olympiad Combinatorics Problems Solutions -

Take a classic problem like “Prove that in any set of 10 integers, there exist two whose difference is divisible by 9.” Apply the pigeonhole principle. You’ve just taken the first step into a larger world.

A finite set of points in the plane, not all collinear. Prove there exists a line passing through exactly two of the points. Olympiad Combinatorics Problems Solutions

But here’s the secret:

Whenever you see sums of numbers counting relationships, try counting the total number of pairs or triples in two ways. 4. Extremal Principle: Look at the Extreme Pick an object that maximizes or minimizes some quantity. Then show that if the desired condition isn’t met, you can find a contradiction by modifying that extreme object. Take a classic problem like “Prove that in