(Generalized) Pigeonhole Principle | Proof, Numericals | Lecture 39 | Discrete Structures | CSIT, TU скачать в хорошем качестве

(Generalized) Pigeonhole Principle | Proof, Numericals | Lecture 39 | Discrete Structures | CSIT, TU

Welcome to The Digital Nerds, your premier source for comprehensive Computer Science courses, meticulously curated from prestigious Nepalese universities. I'm Anjesh Kafle, a computer engineer and seasoned educator dedicated to delivering a tailored educational experience that meets your academic aspirations. While our focus is on bringing Nepalese universities' expertise to the forefront, our content's universal relevance ensures its value extends globally. Here at The Digital Nerds, we're not just about teaching – we're about inspiring curiosity, fostering a learning environment, and preparing you for a world that's increasingly digital. Let's embark on this exciting journey of learning together! ------ In this video, we introduce the Pigeonhole Principle, starting with the core concepts and examples. A proof to the Pigeonhole Principle is also provided using the contraposition technique of contradicting with the premise by assuming to deny the consequent. The second part of the video focuses on the Generalized version of the Pigeonhole Principle, dealing with the core idea and the generalization. Next a couple of examples are provided followed by the proof to the principle. The final section of the video covers two more important problems in the topic. This video belongs to the playlist: Discrete Structures Full Course for Tribhuwan University, under the BSc CSIT programme. ------ Chapters: 0:00 Scope of the Video 0:39 Basics of Pigeonhole Principle 4:02 Proof of Pigeonhole Principle 5:58 Problem Example 1 7:58 Problem 2 (Finding multiple with only 0,1) 15:42 Generalized Pigeonhole Principle 21:30 Proof of Generalized Pigeonhole Principle 25:30 Problem 3 30:46 Problem 4 ------ Make sure to like, share and subscribe! ------ Credits: Text-Book: Kenneth H. Rosen | Discrete Mathematics and its Applications Kolman | Discrete Mathematical Structures ------ References: Previous Video:    • Basics of Counting, Sum, Product Rule, Num...   Next Video:    • Permutations and Combinations, Numerical P...   My Freelancing Profile: https://www.fiverr.com/googlesheetspro Our Facebook Page:   / 100095563598803   ------ All content is for educational purposes only. ------ Keywords: discrete structures, discrete mathematics, csit, course series, computer science, counting and discrete probability, counting, discrete probability, pigeonhole principle, generalized pigeonhole principle, pigeonhole principle proof