MAT 111 Module 9: Counting: Permutations and Combinations
| dc.contributor.author | Michael Obiero | |
| dc.date.accessioned | 2023-04-22T13:45:46Z | |
| dc.date.available | 2023-04-22T13:45:46Z | |
| dc.date.issued | 2023-04-22 | |
| dc.description | This module introduces develops techniques of determining, without direct enumeration, the number of elements in a set, or the number of possible outcomes of an event. Such counting includes the study of permutations and combinations. In this module, you will be introduced to the following concepts: \begin{itemize} \item Basic counting principles, \item The binomial theorem and Pascal's triangle, \item Permutations and combinations, \item The Pigeonhole principle and its applications. \end{itemize} | |
| dc.description.abstract | This module introduces develops techniques of determining, without direct enumeration, the number of elements in a set, or the number of possible outcomes of an event. Such counting includes the study of permutations and combinations. In this module, you will be introduced to the following concepts: \begin{itemize} \item Basic counting principles, \item The binomial theorem and Pascal's triangle, \item Permutations and combinations, \item The Pigeonhole principle and its applications. \end{itemize} | |
| dc.identifier.uri | https://erepository.ouk.ac.ke/handle/123456789/297 | |
| dc.title | MAT 111 Module 9: Counting: Permutations and Combinations |