Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Discrete Math - 6.2.2 A Pigeonhole Proof
Play lesson

Discrete Math II/Combinatorics (Entire course) - Discrete Math - 6.2.2 A Pigeonhole Proof

5.0 (0)
14 learners

What you'll learn

This course includes

  • 13.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Full Transcript

Your textbook does a great job of taking you through several "more elegant" applications of the Pigeonhole Principle. In this video, I take you through one that isn't showcased in your textbook in proving that 9 ordered triples must have at least one pair that have integer midpoints. Video Chapters: Intro 0:00 Setting up the Proof 0:31 The Proof 6:18 Up Next 11:10 This playlist uses Discrete Mathematics and Its Applications, Rosen 8e Power Point slide decks to accompany the videos can be found here: https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0 The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere