if A and B are finite sets with |B|=n and |A| >= kn + 1 where k and n are positive integers and f:A--->B, then there exists a b within B such that |f^-1(b)| >= k+1.
Does anyone know how to prove this?
Edit: It may also help to think of the problem in more concrete terms. (All this inverse function stuff gives me a headache.) Rephrase the problem: If more than kn objects are placed in n pigeonholes, then some pigeonhole contains more than k objects.