Four basic combinatorial counting problems | Data structures in Mathematics Math Foundations 162

The four basic kinds of data structures that we have been considering, namely lists, ordered sets, multisets and sets, have four basic counting problems associated to them. For example, we can ask how many k-lists from n are there? The answer depends on both n and k.

As we range through the four data structures, we get the four most basic and fundamental counting problems in mathematics. One of them is considerably more challenging than the others!

Video Content:
00:00 Introduction
1:11 List(n,k)
3:44 Counting ordered sets
6:54 Counting set (n,k)
11:28 Counting Mset(n,k)
15:16 Mset(5,3)
19:42 Mset(1 1 5)
24:46 Counting the size of an Mset

************************
Screenshot PDFs for my videos are available at the website http://wildegg.com. These give you a concise overview of the contents of the lectures for various Playlists: great for review, study and summary.

My research papers can be found at my Research Gate page, at https://www.researchgate.net/profile/...

My blog is at http://njwildberger.com/, where I will discuss lots of foundational issues, along with other things.

Online courses will be developed at openlearning.com. The first one, already underway is Algebraic Calculus One at https://www.openlearning.com/courses/... Please join us for an exciting new approach to one of mathematics' most important subjects!

If you would like to support these new initiatives for mathematics education and research, please consider becoming a Patron of this Channel at   / njwildberger   Your support would be much appreciated.

Here are the Insights into Mathematics Playlists:

   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист