1. Math
  2. Advanced Math
  3. q1 10 points prove the following version of the pigeonhole...

Question: q1 10 points prove the following version of the pigeonhole...

Question details

Q1 (10 points) Prove the following version of the pigeonhole principle Let ni,n2. , ng be positive integers, and suppose we have k boxes each of which is labelled with a different integer from 1 to k. If we distribute ni n2 .+nk-k+1 objects among these k boxes, show that there exists some i E ,k] for which the following is true: box i contains at least n, objects.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution