Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.2 - The Pigeonhole Principle - Exercises - Page 405: 9

Answer

See step by step answer for solution.

Work Step by Step

The generalized pigeonhole principle applies here. The pigeons are the students, and the pigeonholes are the states, 50 in number. By the generalized pigeonhole principle if we want at least 100 pigeons in at least one of the pigeonholes, then we need to have a total of N pigeons such that $\left \lceil{\frac{N}{50}}\right \rceil \geq 100$ i.e., N $\geq$ (99 . 50) + 1 = 4951. Therefore we need at least 4951 students to guarantee that at least 100 come from a single state.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.