Скачать с ютуб So Counting is Actually Pretty Hard в хорошем качестве

So Counting is Actually Pretty Hard

We introduce combinatorics with some basic counting problems, including the fundamental principle of enumeration, some clever counting, and the sieve theorem, more commonly known as the inclusion/exclusion principle for counting the number of elements in the union of a collection of sets. #combinatorics #counting #maths Join Wrath of Math to get exclusive videos, lecture notes, and more:    / @wrathofmath   More math chats:    • Math Chats   Textbooks I Like! Graph Theory: https://amzn.to/3JHQtZj Real Analysis: https://amzn.to/3CMdgjI Abstract Algebra: https://amzn.to/3IjoZaO Linear Algebra: https://amzn.to/43xAWEz Calculus: https://amzn.to/3PieD1M Proofs and Set Theory: https://amzn.to/367VBXP (available for free online) Statistics: https://amzn.to/4d5HbUQ Discrete Math: https://amzn.to/3qfhoUn Number Theory: https://amzn.to/3JqpOQd Algebra 1: https://amzn.to/3Z4SPvu Algebra 2: https://amzn.to/3LWC7XD Precalculus: https://amzn.to/4fO4On9 ★DONATE★ ◆ Support Wrath of Math on Patreon:   / wrathofmathlessons   ◆ Donate on PayPal: https://www.paypal.me/wrathofmath Follow Wrath of Math on... ● Instagram:   / wrathofmathedu   ● TikTok:   / wrathofmathedu   ● X: https://x.com/wrathofmathedu 0:00 Intro 1:46 Our First Counting Problem 5:32 Fundamental Principle of Enumeration 7:26 Coloring Blocks 9:22 Sieve Theorem Part 1 10:59 Sieve Theorem Part 2 15:01 Sieve Theorem Part 3 20:49 The Formula 24:25 Conclusion