1 / 8

The Pigeonhole Principle

The Pigeonhole Principle. The Pigeonhole Principle. What is n ?. http://www.blog.republicofmath.com/archives/3115. In words: If n pigeons are in fewer than n pigeonholes, some pigeonhole must contain at least two pigeons. The Pigeonhole Principle. In math:. The Pigeonhole Principle.

tessica
Download Presentation

The Pigeonhole Principle

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Pigeonhole Principle

  2. The Pigeonhole Principle What is n? http://www.blog.republicofmath.com/archives/3115 • In words: • If n pigeons are in fewer than n pigeonholes, some pigeonhole must contain at least two pigeons

  3. The Pigeonhole Principle • In math:

  4. The Pigeonhole Principle What is a set? a finite set? What is |A|? What is a function? the domain of a function? the codomain of a function? Why say “distinct”?

  5. Applications of The Pigeonhole Principle In any group of 8 people, two were born on the same day of the week What are the “pigeons” and what are the “pigeonholes”? A = the set of people, B = {Sun, … Sat}, f(a) = the day of the week on which a was born

  6. Applications of The Pigeonhole Principle • Suppose each pigeonhole contains one bird, and every bird moves to an adjacent square (up, down, left or right). Show that no matter how this is done, some pigeonhole winds up with at least 2 birds.

  7. Applications of The Pigeonhole Principle • Suppose each pigeonhole contains one bird, and every bird moves to an adjacent square (up, down, left or right). Show that no matter how this is done, some pigeonhole winds up with at least 2 birds.

  8. Applications of The Pigeonhole Principle • Suppose each pigeonhole contains one bird, and every bird moves to an adjacent square (up, down, left or right). Show that no matter how this is done, some pigeonhole winds up with at least 2 birds.

More Related